.png){kind=icon}
返回
Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2022.105728.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the type-2 integrated process-planning and scheduling (IPPS) problem where each job is represented by a directed network graph. To the best of our knowledge, there is only one mathematical model in the literature implementing the type-2 IPPS partially, and the solution methods available for this problem are all based on heuristics and metaheuristics. We introduce three properties that enable us to fully formulate all aspects of the type-2 IPPS problem with a mathematical programming model for the first time. To solve our model, we develop a logic-based Benders decomposition method hybridized with constraint programming. We decompose the problem into two smaller ones such that we can use the best solution technique for each one, master problem and subproblem. To enhance our solution approach, we incorporate a combinatorial relaxation of subproblem into the master problem. We evaluate our method using a well-known benchmark including 24 instances and compare its performance with six existing solution methods solving the same benchmark. We solve all the 24 instances of this benchmark to optimality where seven of these 24 instances are solved to optimality for the first time. We also generate a new set of 144 larger instances to further evaluate our solution methods and provide insights on when each method performs better.
Keyword:
Type-2 integrated process planning and scheduling problem
Benders decomposition
Constraint programming
Optimality cut
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling用于分布式手术室调度的基于传播逻辑的benders分解方法
PREAI
分享收藏
A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling
PREAI
分享收藏
查看更多内容