.png){kind=icon}
返回
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2020.106347.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper intends to address the distributed flexible job shop scheduling problem (DFJSP) with minimizing maximum completion time (makespan). In order to solve this problem, we propose four mixed integer linear programming (MILP) models as well as a constraint programming (CP) model, among which four MILP models are formulated based on four different modeling ideas. MILP models are effective in solving small-scaled problems to optimality. DFJSP is NP-hard, therefore, we propose an efficient constraint programming (CP) model based on interval decision variables and domain filtering algorithms. Numerical experiments are conducted to evaluate the performance of the proposed MILP models and CP model. The results show that the sequence-based MILP model is the most efficient one, and the proposed CP model is effective in finding good quality solutions for the both the small-sized and large-sized instances. The CP model incomparably outperforms the state-of-the-art algorithms and obtains new best solutions for 11 benchmark problems. Moreover, the best MILP model and CP model have proved the optimality of 62 best-known solutions.
Keyword:
Distributed flexible job shop scheduling problem
Mixed integer linear programming
Constraint programming
Makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Mathematical modeling and evolutionary generation of rule sets for energy-efficient flexible job shops.png)
ENERGY
ENERGYIF9.4
PREAI
分享收藏
Effect of lanthanum carbonate on coronary artery calcification and bone mineral density in maintenance hemodialysis patients with diabetes complicated with adynamic bone diseaseMedicine
OAAI
MedicineIF0
OAAI分享收藏
查看更多内容