数学优化
约束规划
调度(生产过程)
计算机科学
作业车间调度
水准点(测量)
计算
资源限制
分界
序列(生物学)
数学
算法
地铁列车时刻表
分布式计算
随机规划
操作系统
地理
生物
遗传学
大地测量学
作者
Pınar Yunusoğlu,Şeyda Topaloğlu
标识
DOI:10.1080/00207543.2021.1885068
摘要
This paper studies the multi-resource-constrained unrelated parallel machine scheduling problem under various operational constraints with the objective of minimising maximum completion time among the scheduled jobs. Sequence-dependent setup times, precedence relations, machine eligibility restrictions and release dates are incorporated into the problem as operational constraints to reflect real-world manufacturing environments. The considered problem is in NP-hard class of problems, which cannot be solved in deterministic polynomial time. Our aim in this study is to develop an exact solution approach based on constraint programming (CP), which shows good performance in solving scheduling problems. In this regard, we propose a CP model and enrich this model by adding lower bound restrictions and redundant constraints. Moreover, to achieve a reduction in computation time, we propose two branching strategies for the proposed CP model. The performance of the CP model is tested using randomly generated and benchmark instances from the literature. The computational results indicate that the proposed CP model outperforms the best solutions with an average gap of 15.52%.
科研通智能强力驱动
Strongly Powered by AbleSci AI