Efficient scheduling of a stochastic no-wait job shop with controllable processing times
作者：
Highlights：
• We present a systematic consideration of stochastic processing times.
• A recursive timetabling algorithm handles controllable processing times.
• An algorithm calculates the safety margins of the scheduled time slots.
• The sequencing punishes tasks with high uncertainty at critical time slots.
• We solve a scheduling problem from an industrial hot rolling mill.
摘要
•We present a systematic consideration of stochastic processing times.•A recursive timetabling algorithm handles controllable processing times.•An algorithm calculates the safety margins of the scheduled time slots.•The sequencing punishes tasks with high uncertainty at critical time slots.•We solve a scheduling problem from an industrial hot rolling mill.
论文关键词：No-wait job shop,Controllable processing times,Stochastic scheduling,Recursive timetabling,Tabu search,Dynamic tabu list
论文评审过程：Received 23 April 2020, Revised 24 July 2020, Accepted 11 August 2020, Available online 19 August 2020, Version of Record 10 October 2020.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.113879
