.png){kind=icon}
返回
Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2023.102997.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed flowshop group scheduling problem (DFGSP) is commonly seen in modern industry. However, research works on DFGSP with total flow time criterion are rarely reported. The DFGSP consists of three coupled sub-problems, i.e., factory assignment for each group, group sequence in each factory, and job sequence within each group. A historical information-based iterated greedy algorithm (HIG) is proposed for solving the DFGSP with the objective of minimizing total flow time. The HIG integrates an iterated greedy algorithm (IG) with a group-based insertion operator, a job-based insertion operator, a domination criterion-based swap operator, and a historical information-based constructive solution method. The domination criterion is an effective inequality, which can deterministically optimize the objective value of a partial sequence even if the scheduling sequence of subsequent jobs is unknown. In the constructive solution method, a set covering model is designed to capture the effective factory allocation patterns for the groups hidden in the historical solutions to speed up the search for the IG. The comprehensive experiments on 810 test instances demonstrate the effectiveness of HIG.
Keyword:
Distributed flowshop
Group scheduling
Total flow time
Iterated greedy
Domination criterion
Historical information
期刊
O
IF:
7.2
论文数:
3.8K
被引数:
1.4W
机构
引用论文
A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏分享收藏分享收藏分享收藏A modified adaptive switching-based many-objective evolutionary algorithm for distributed heterogeneous flowshop scheduling with lot-streaming一种改进的基于自适应切换的多目标进化算法，用于具有批量流的分布式异构流水车间调度
PREAI
分享收藏
查看更多内容