.png){kind=icon}
返回
The Distributed Assembly Permutation Flowshop Scheduling Problem
.png){kind=icon}
OA
AI
DOI：10.1080/00207543.2013.807955.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The objective is to minimise the makespan. We present first a Mixed Integer Linear Programming model (MILP). Three constructive algorithms are proposed. Finally, a Variable Neighbourhood Descent (VND) algorithm has been designed and tested by a comprehensive ANOVA statistical analysis. The results show that the VND algorithm offers good performance to solve this scheduling problem.
Keyword:
distributed assembly flowshop
variable neighbourhood descent
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems带显性基因的遗传算法在柔性制造系统分布式调度问题中的应用
PREAI
分享收藏Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
PREAI
分享收藏
查看更多内容