Robust job shop scheduling problem: Mathematical models, exact and heuristic algorithms

作者：

Highlights：

• In real world applications, the job shop schedules are contaminated with disruptions.

• Robust schedules should be able to absorb the predefined range of disruptions.

• We propose 2 robustness measures.

• We propose 2 exact and 2 heuristic methods to reach a robust solution.

摘要

•In real world applications, the job shop schedules are contaminated with disruptions.•Robust schedules should be able to absorb the predefined range of disruptions.•We propose 2 robustness measures.•We propose 2 exact and 2 heuristic methods to reach a robust solution.

论文关键词：Job shop scheduling,Robustness index,Disruption,Branch and Bound,Particle swarm optimization

论文评审过程：Received 1 January 2015, Revised 18 January 2016, Accepted 26 January 2016, Available online 6 February 2016, Version of Record 5 March 2016.

论文官网地址：https://doi.org/10.1016/j.eswa.2016.01.054