.png){kind=icon}
返回
Supply chain-oriented two-stage assembly flowshops with sequence-dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2021.08.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Supply chain-oriented scheduling problems have received recent recognition among production research scholars due to their ability in integrating production planning and control across manufacturing systems. This study contributes to the literature of the distributed scheduling problems developing an original Mixed-Integer Linear Programming (MILP) formulation to the Distributed Two-Stage Assembly Flowshop Scheduling Problem with Sequence-Dependent Setup Times (DTSAFSP-SDSTs). Besides, the Iterated Greedy algorithm is extended to effectively solve this relatively complex production scheduling situation considering the makespan as the optimization criterion. Extensive numerical tests and statistical analyses are conducted to evaluate the effectiveness of the developed solution algorithm. Results showed that the Improved Iterated Greedy (IIG) algorithm yields the best solution in nearly all of the large-scale instances. The statistical test of significance confirmed that IIG is superior to the current-best-performing algorithm. This study contributes to the transition from standalone optimization to integrated production planning and control of distributed manufacturing systems.
Keyword:
Operations management
Production planning and control
Distributed manufacturing systems (DMS)
Two-stage assembly flowshop
Distributed Scheduling Problem
Metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
14.2
论文数:
2.7K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times具有分离设置时间的两阶段装配调度问题的混合分支定界算法
PREAI
分享收藏A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling两阶段无等待混合流水车间调度的分支定界算法
PREAI
分享收藏分享收藏
查看更多内容