Two approaches to handle the dynamism in a scheduling problem with sequence-dependent setup times
作者：
Highlights：
• We address a dynamic scheduling problem with sequence-dependent setup times.
• We implement continuous and periodic rescheduling approaches to handle the dynamism.
• We propose 3 algorithms for each approach comparing with the best published method.
• We present a perfect information model to assess the proposed algorithms’ quality.
• All the proposed algorithm variants are very fast and reach high quality solutions.
摘要
•We address a dynamic scheduling problem with sequence-dependent setup times.•We implement continuous and periodic rescheduling approaches to handle the dynamism.•We propose 3 algorithms for each approach comparing with the best published method.•We present a perfect information model to assess the proposed algorithms’ quality.•All the proposed algorithm variants are very fast and reach high quality solutions.
论文关键词：Dynamic scheduling,Continuous rescheduling,Periodic rescheduling,Sequence-dependent setups,Single machine
论文评审过程：Received 1 May 2020, Revised 15 September 2020, Accepted 17 October 2020, Available online 20 October 2020, Version of Record 10 February 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.114137
