A Novel Imperialist Competitive Algorithm for Energy-Efficient Permutation Flow Shop Scheduling Problem Considering the Deterioration Effect of Machines
This study addresses a critical gap in Energy-Efficient Permutation Flow Shop Scheduling (EPFSP) by integrating the often-overlooked time-accumulative equipment degradation inherent in practical manufacturing. This research formalizes and solves the EPFSP with machine deterioration (EPFSP-DEM), aiming to simultaneously minimize the makespan and total energy consumption. To achieve this objective, this study proposes a Diversity-Constrained Imperialist Competitive Algorithm (DCICA) featuring several novel mechanisms. In DCICA, a differentiated assimilation is developed to improve diversity of the population; a knowledge-guided revolution is designed to allocate computing resources efficiently; the convergence and diversity metrics are defined to evaluate the search quality on assimilation and revolution; a novel imperialist competition is also given to enhance information exchanges among empires and strengthen the search for some worse solutions. Finally, extensive experiments are conducted, and the results demonstrate that DCICA outperforms the existing algorithms in solving the investigated problem.
Authors
- Yi Chen (ORCID: https://orcid.org/0000-0001-7960-8374)
- Kaiyang Yin (ORCID: https://orcid.org/0000-0003-1718-9551)
- Yaxu Xue (ORCID: https://orcid.org/0000-0002-9218-4251)
- Zhi Li (ORCID: https://orcid.org/0000-0002-4869-6778)
- Ming Li (ORCID: https://orcid.org/0000-0003-0480-1393)
Institutions
- Pingdingshan University (CN)
- Xi’an Jiaotong-Liverpool University (CN)
- Anhui Polytechnic University (CN)
Publication Details
- Journal
- Mathematics
- Published
- 2025-12-13
- DOI
- https://doi.org/10.3390/math13243973
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Science and Technology Department of Henan Province