.png){kind=icon}
返回
Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2021.106959.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributed permutation flow-shop scheduling problem (DPFSP) has achieved much attention in recent years, which always assumes that there are infinite buffers between any consecutive machines. However, in many practical industrials, no buffers exist between some consecutive machines due to space constraint or technological requirement, which generate various types of blocking constraint. Hence, a distributed mixed permutation blocking flow-shop scheduling problem (DMBPFSP) is investigated in this paper, which considers three types of blocking constraint and without blocking. The objective is to minimize the maximum makespan among all factories. To address this problem, an improved NEH heuristic (NEH_P) is proposed, which incorporates the re-optimization of partial solutions. Afterwards, an efficient iterated greedy (EIG) algorithm is proposed. In the proposed EIG, the NEH_P heuristic is employed to generate the initial solution with high quality. A problem-specific knowledge based destruction-construction is used to explore the solution space. Three efficient local search procedures are designed to implement exploitation around the critical factory and exploitation across multi factory. We compare the proposed methods against the closely relevant and high-performing methods in the literature. The computational results indicate that both NEH_P and EIG are very effective for addressing the considered problem. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Distributed manufacturing
Flow-shop scheduling
Blocking constraints
Constructive heuristic
Iterated greedy method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Multi-temperature simulated annealing for optimizing mixed-blocking permutation flowshop scheduling problems用于优化混合块置换流水车间调度问题的多温度模拟退火
PREAI
分享收藏Minimizing Makespan in Distributed Blocking Flowshops Using Hybrid Iterated Greedy Algorithms使用混合迭代贪婪算法最小化分布式阻塞流水车间中的制造时间.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容