Robust scheduling approach for job shop manufacturing systems with sequential flexibility
摘要
The problem of finding robust solutions for scheduling problems is crucial for real-manufacturing systems as they operate in scalable environments. This paper deals with the job shop scheduling problem and describes an approach based on sequential flexibility that generates robust schedules. Unlike an optimal solution that cannot be adapted to changes when necessary, the robust solution can easily be modified in real-time when potential perturbations occur during the scheduling execution. A flexibility measure is used, and it is linked to the fact that several alternative job sequences are characterized, allowing to switch from one solution to another with a performance bounded by values at the best and at the worst makespan. In this work, a procedure for robust job shop scheduling is proposed. It is supported by a series of experiments using existing benchmarks. The results obtained are valuable and demonstrate the effectiveness of the proposed approach.