Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

作者：

Highlights：

• A single machine scheduling problem with periodic maintenance and sequence-dependent set-up times is analyzed.

• The problem has practical relevance because of its industrial applications: textile, chemical, circuit boards, etc.

• A new MILP formulation is proposed. This new formulation can solve larger instances than with previous ones.

• A Skewed VNS approach with memory is proposed. It improves significantly the performance of previous heuristics.

摘要

•A single machine scheduling problem with periodic maintenance and sequence-dependent set-up times is analyzed.•The problem has practical relevance because of its industrial applications: textile, chemical, circuit boards, etc.•A new MILP formulation is proposed. This new formulation can solve larger instances than with previous ones.•A Skewed VNS approach with memory is proposed. It improves significantly the performance of previous heuristics.

论文关键词：Scheduling,Periodic maintenance,Sequence-dependent setup,Variable neighborhood search,Memory

论文评审过程：Received 10 September 2017, Revised 16 December 2017, Accepted 20 January 2018, Available online 31 January 2018, Version of Record 20 February 2018.

论文官网地址：https://doi.org/10.1016/j.knosys.2018.01.018