Abstract

This article investigates the flexible job-shop scheduling problem (FJSP) with multi-uncertain. A proactive-reactive scheduling mechanism is put forward to against the fluctuating process time and equipment breakdowns. This mechanism consists of two stages, including proactive scheduling stage and reactive scheduling stage. In the proactive scheduling stage, the redundancy-based technique is used to generate robust baseline schedules; in the reactive scheduling stage, a reactive scheduling is adopted to rectify the predictive scheduling to adapt to the occurrence of machine failures. Based on this, an integrating algorithm is presented with the goal of the make span. Numerical experiments show that the proposed algorithm has a better performance than Genetic Algorithm (GA) on flexible job-shop scheduling problem under processing time uncertainty and the reactive scheduling algorithm can handle the equipment breakdown with little robustness lost.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.