.png){kind=icon}
返回
Optimizing distributed reentrant heterogeneous hybrid flowshop batch scheduling problem: Iterative construction-local search-reconstruction algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101681.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent years, the distributed hybrid flowshop scheduling problem (DHFSP) has garnered widespread attention due to the continuous emergence of practical challenges. The production model, characterized by multiple varieties and small batches, is widely observed in the industrial sector. Additionally, in various real-world scenarios, batches often undergo repeated processes across multiple stages. This paper addresses the research gap by introducing the reentrant nature of batches and the heterogeneity of factories into the DHFSP, resulting in a novel problem referred to as the distributed reentrant heterogeneous hybrid flowshop batch scheduling problem (DRHHFBSP). To tackle this problem, we propose a mixed-integer linear programming (MILP) model. Given that this problem falls into the NP-hard category, an iterative construction-local search-reconstruction algorithm (ICLSRA) is designed. Specifically designed by incorporating construction, local search, and reconstruction processes that have different roles, this algorithm strikes a balance between local and global search. Comparative analysis with the MILP model and state-of-the-art algorithms demonstrates the superiority of ICLSRA in achieving efficient solutions for the DRHHFBSP.
Keyword:
Distributed hybrid flowshop scheduling
Heuristic
Batch scheduling
Reentrant scheduling
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints具有阻塞约束的分布式异构混合流水车间调度的协同迭代贪婪算法
PREAI
分享收藏
查看更多内容