Binhui Wang, Hongfeng Wang*
CMC-Computers, Materials & Continua, Vol.82, No.1, pp. 371-388, 2025, DOI:10.32604/cmc.2024.058885
- 03 January 2025
Abstract The distributed permutation flow shop scheduling problem (DPFSP) has received increasing attention in recent years. The iterated greedy algorithm (IGA) serves as a powerful optimizer for addressing such a problem because of its straightforward, single-solution evolution framework. However, a potential draw-back of IGA is the lack of utilization of historical information, which could lead to an imbalance between exploration and exploitation, especially in large-scale DPFSPs. As a consequence, this paper develops an IGA with memory and learning mechanisms (MLIGA) to efficiently solve the DPFSP targeted at the mini-mal makespan. In MLIGA, we incorporate a memory… More >
Login
Register
