.png){kind=icon}
.png){kind=icon}
Return
New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2021.107229.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Just-in-time production in large enterprises along with the factory's limited space highlights the need for scheduling tools that consider blocking conditions. This study contributes to the scheduling litera-ture by developing an effective metaheuristic to address the Blocking Flowshop Scheduling Problems with Sequence-Dependent Setup-Times (BFSP with SDSTs). Including a new constructive heuristic and a local search mechanism customized for the blocking and setup time features, the Extended Iterated Greedy (EIG) algorithm effectively solves this highly intractable scheduling extension. The performance of the EIG algorithm is compared with that of the best-performing algorithms in the literature developed to solve the BFSP with SDSTs. Extensive numerical tests and statistical analyses verify EIG's superiority over the benchmark algorithms and show that EIG performs steadily over various operational situations. Applications of the improved algorithm in this study are worthwhile topics to solve other complex scheduling problems. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Flowshop scheduling
Just-in-time production
Blocking
Setup times
Metaheuristics
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W