Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives
Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives
复制标题
DOI：
10.1080/00207540500103953
复制
发表时间：
2005-08
影响因子：
9.2
通讯作者：
James Curry;Brett A. Peters
中科院分区：
文献类型：
--
作者：
James Curry;Brett A. Peters
在重新调度过程中机器分配的紧张可能会导致调度系统的实施问题。本文研究了由于新的作业到达系统的重新调度。考虑了具有逐步增加的拖期成本目标、非零机器准备时间、限制机器再分配的约束条件和机器再分配成本的并行机排序问题。仿真实验和个别调度问题表明，在一些并行机调度环境中，神经可以以较低的成本得到控制。仿真中的重调度问题采用分支价格算法求解。通过选择具有最少机器再分配的替代最优解，可以实现调度稳定性的显著增益。
Nervousness in machine assignments during rescheduling can cause problems for the implementation of a scheduling system. This paper examines rescheduling due to the arrival of new jobs to the system. Parallel machine scheduling problems with stepwise increasing tardiness cost objectives, non-zero machine ready times, constraints that limit machine reassignments, and machine reassignment costs are considered. Simulation experiments and individual scheduling problems indicate that nervousness can be controlled at a low cost in some parallel machine scheduling environments. The rescheduling problems in the simulation are solved with a branch-and-price algorithm. Significant gains in schedule stability can be achieved by selecting the alternative optimal solution with the fewest machine reassignments.