.png){kind=icon}
.png){kind=icon}
Return
A two-stage iterated greedy algorithm for distributed blocking flowshop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2025.130422.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper deals with the distributed blocking flowshop scheduling problem (DBFSP), a critical challenge in modern manufacturing systems involving multiple factories. Each factory operates as a blocking flowshop without intermediate buffers between successive machines. The objective of DBFSP is to minimize the makespan among all factories. First, a mixed integer linear programming model (MILP) is presented based on the positions of jobs. Second, by analyzing problem-specific properties, we prove two theorems: (1) removing a job from a factory reduces the factory’s makespan, and (2) inserting a new job into a factory increases the factory’s makespan. Then, an effective two-stage iterated greedy (TIG) algorithm is proposed. TIG includes a constructive heuristic method, a local search procedure with a multi-neighborhood structure designed according to the above two theorems, and a novel destruction and construction combining the total blocking time and idle time of each job. Finally, results of experiments on 720 benchmark instances demonstrate that the proposed TIG algorithm outperforms state-of-the-art DBFSP methods. In addition, 320 out of 720 instances achieve new best-known solutions with significant margins.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W