计算机科学
数学优化
调度(生产过程)
约束规划
作业车间调度
资源限制
流水车间调度
数学
分布式计算
随机规划
地铁列车时刻表
操作系统
作者
Francisco Yuraszeck,Gonzalo Mejía,Armin Lüer‐Villagra
摘要
Abstract In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource‐constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.
科研通智能强力驱动
Strongly Powered by AbleSci AI