整数规划
计算机科学
调度(生产过程)
数学优化
线性规划
序列(生物学)
作业车间调度
运筹学
算法
数学
地铁列车时刻表
遗传学
生物
操作系统
作者
Georgios M. Kopanos,José M. Laínez‐Aguirre,Luís Puigjaner
摘要
Setup times and/or costs appear in a plethora of industrial and service applications. Sequence-dependent setup times and costs entail significantly complex scheduling problems. In this paper, a new continuous time precedence-based mixed-integer linear programming scheduling framework is developed for dealing with sequence-dependent setup time and/or cost issues. This model is based on the unit-specific general precedence concept, which is introduced in this paper. Several case studies are carried out in order to highlight the efficiency and the special features of the proposed model. Comparisons were made with the existing precedence-based formulations. Medium-sized scheduling problems can be solved by the proposed framework with relatively low computational effort.
科研通智能强力驱动
Strongly Powered by AbleSci AI