返回
New Benchmark Algorithm for Minimizing Total Completion Time in blocking flowshops with sequence-dependent setup times
DOI:10.1016/j.asoc.2021.107229.png)
摘要
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.
Keyword:
Flowshop scheduling
Just-in-time production
Blocking
Setup times
Metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Solving the dynamic economic dispatch by a memory-based global differential evolution and a repair technique of constraint handling
ENERGY
IF9.4
Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms使用混合迭代贪婪算法最小化分布式阻塞流水车间中的制造时间
IEEE ACCESS
IF3.6
Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times
IEEE ACCESS
IF3.6

