A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times
作者：
Highlights：
• A neighborhood search function for the flexible job shop scheduling with sequence-dependent setup times is developed.
• Experimentations are conducted to determine its best working parameters under different problem conditions.
• A tabu search approach is developed to demonstrate the utilization of the developed neighborhood search function.
• Simple lower bounds are introduced to assess the performance of the developed tabu search approach.
摘要
•A neighborhood search function for the flexible job shop scheduling with sequence-dependent setup times is developed.•Experimentations are conducted to determine its best working parameters under different problem conditions.•A tabu search approach is developed to demonstrate the utilization of the developed neighborhood search function.•Simple lower bounds are introduced to assess the performance of the developed tabu search approach.
论文关键词：Flexible job shop scheduling,Sequence-dependent setup time,Neighborhood search,Tabu search,Algorithm design
论文评审过程：Received 19 October 2013, Revised 17 December 2014, Accepted 11 March 2015, Available online 4 April 2015.
论文官网地址：https://doi.org/10.1016/j.amc.2015.03.059
