Disruption management for machine scheduling: The case of SPT schedules
Disruption management for machine scheduling: The case of SPT schedules
复制标题
DOI：
10.1016/j.ijpe.2005.05.021
复制
发表时间：
2006-09
影响因子：
12
通讯作者：
X. Qi;J. Bard;Gang Yu
中科院分区：
文献类型：
--
作者：
X. Qi;J. Bard;Gang Yu
本文解决了在处理了一部分作业后发生随机中断或预期中断时更新机器调度的问题。在这种情况下，继续执行原计划可能是次优的，甚至可能是不可行的。这里采用的方法与大多数重新安排分析的不同之处在于，与原计划和新计划之间的偏差相关的成本包括在模型中。我们专注于最短处理时间（SPT）规则对原始问题最优的情况。考虑了单机和并行双机环境。
This paper addresses the problem of updating a machine schedule when either a random or an anticipated disruption occurs after a subset of the jobs has been processed. In such cases, continuing with the original schedule is likely to be suboptimal and may not even be feasible. The approach taken here differs from most rescheduling analysis in that the cost associated with the deviation between the original and the new schedule is included in the model. We concentrate on cases in which the shortest processing time (SPT) rule is optimal for the original problem. Both single and parallel two-machine environments are considered.