A quick and effective iterated greedy algorithm for energy-efficient hybrid flow shop scheduling problem with blocking constraint

• Main Authors: Qin, Hao-xiang, Han, Yuyan, Li, Junqing, Sang, Hongyan, Chen, Qingda, Meng, Leilei, Zhang, Biao
• Format: Conference Proceeding
• Language: English
• Subjects: BHFSP; Energy consumption; Energy efficiency; energy-efficient; Greedy algorithms; Job shop scheduling; Perturbation methods; perturbation strategy; Processor scheduling; quick; Uncertainty
• ISSN: 2573-3311
• DOI: 10.1109/ICIST52614.2021.9440648

With the continuous development of national economy, the problems of energy consumption are becoming more and more prominent. Similarly, the energy efficient scheduling problem in manufacturing has attracted much attention of the researchers. Some flow-shop scheduling problems have made progress on energy saving, but the research on hybrid flow shop with blocking constraint(BHFSP) is very few. Due to its NP-hard characteristic, in this paper, we suggest a mathematical model of BHFSP and a meta heuristic method named quick iterative greedy algorithm (IGQ) to solve this problem. Compared with other existing IG algorithms, for BHFSP, three main contributions of the IGQ are described as follows: First, we use the MME to initialize the solution. Second, we develop a quick local perturbation strategy to ensure the convergence of the algorithm. Third, a quick global perturbation strategy is proposed to guarantee the diversity of the algorithm. Computational results and comparisons verify the effectiveness of proposed algorithm IGQ for solving BHFSP.