Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling

Article type: Research Article

Authors: Guo, Jiong^a | Lei, Deming^a | Li, Ming^{b; *}

Affiliations: [a] School of Automation, Wuhan University of Technology, Wuhan, China | [b] School of Economics and Management, Anhui Polytechnic University, Wuhu, China

Correspondence: [*] Corresponding author. Ming Li, School of Economics and Management, Anhui Polytechnic University, Wuhu 241000, China. E-mail: [email protected].

Abstract: Energy-efficient flexible job shop scheduling problems (EFJSP) have been investigated fully; however, energy-related objectives often have lower importance than other ones in many real-life situations and this case is hardly considered in the previous works. In this study, EFJSP with sequence-dependent setup times (SDST) is considered, in which total tardiness and makespan are given higher importance than total energy consumption. A two-phase imperialist competitive algorithm (TPICA) is proposed. The importance difference among objectives is implemented by treating all objectives equally in the first phase and making energy consumption not to exceed a diminishing threshold in the second phase. A dynamical differentiating assimilation and a novel imperialist competition with the enforced search are implemented. Extensive experiments are conducted and the computational results show that TPICA is very competitive for EFJSP with SDST.

Keywords: Flexible job shop scheduling, energy-efficient scheduling, imperialist competitive algorithm, sequence-dependent setup times

DOI: 10.3233/JIFS-210198

Journal: Journal of Intelligent & Fuzzy Systems, vol. 40, no. 6, pp. 12125-12137, 2021