In this paper, a multi-objective hybrid flowshop rescheduling problem (HFRP) is addressed in a dynamic shop environment where two types of real-time events, namely machine breakdown and job cancellation, simultaneously happen. For the addressed problem, two objectives are considered. One objective concerning the production efficiency is minimizing the maximum completion time or makespan, while regarding with the instability, the total number of the jobs assigned to different machines between the revised and the origin schedule is considered. A multi-objective evolutionary algorithm based on decomposition (MOEA/D) is applied to solve this problem. In the algorithm, the weighted sum approach is used as the decomposition strategy. The algorithm is, then, rigorously compared with three state-of-the-art evolutionary multi-objective optimizers, and the computational results demonstrate the effectiveness and efficiency of the algorithm.
MOEA/D for Multi-Objective Hybrid Flowshop Rescheduling Problem
- Views Icon Views
- Share Icon Share
- Search Site
Zhang, B, Pan, Q, Gao, L, & Zhao, Y. "MOEA/D for Multi-Objective Hybrid Flowshop Rescheduling Problem." Proceedings of the ASME 2018 13th International Manufacturing Science and Engineering Conference. Volume 4: Processes. College Station, Texas, USA. June 18–22, 2018. V004T03A040. ASME. https://doi.org/10.1115/MSEC2018-6581
Download citation file: