Rescheduling for New Orders

Rescheduling for New Orders
复制标题

DOI:
10.1287/opre.1030.0101
复制
发表时间:
2004-06
期刊:
Oper. Res.
影响因子:
--
通讯作者:
Nicholas G. Hall;C. Potts
Nicholas G. Hall;C. Potts
中科院分区:
其他
文献类型:
--
作者:
Nicholas G. Hall;C. Potts

文献摘要

被引文献

相似文献

本文考虑了调度问题,其中一组原始作业已被调度以最小化某些成本目标,当一组新作业到达并造成中断时。决策者需要将新的工作插入到现有的计划中,但又不会过度扰乱它。考虑两类模型。首先,我们最小化所有作业的调度成本,但要限制对原始调度造成的干扰,这种干扰可以通过多种方式来衡量。在第二类中,总成本目标(包括原始成本衡量和中断成本)被最小化。对于基于经典调度目标的类别和各种成本,以及几乎所有问题,我们提供了一种有效的算法或证明这种算法不太可能存在。我们还展示了如何扩展这两类模型,以应对新工作重复到来所带来的多重干扰。我们的工作将有关调度问题的大量文献重新集中到重新调度问题上,这很重要,因为制造实践中经常发生中断。
This paper considers scheduling problems where a set of original jobs has already been scheduled to minimize some cost objective, when a new set of jobs arrives and creates a disruption. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. Two classes of models are considered. First, we minimize the scheduling cost of all the jobs, subject to a limit on the disruption caused to the original schedule, where this disruption is measured in various ways. In the second class, a total cost objective, which includes both the original cost measure and the cost of disruption, is minimized. For both classes and various costs based on classical scheduling objectives, and for almost all problems, we provide either an efficient algorithm or a proof that such an algorithm is unlikely to exist. We also show how to extend both classes of models to deal with multiple disruptions in the form of repeated arrivals of new jobs. Our work refocuses the extensive literature on scheduling problems towards issues of rescheduling, which are important because of the frequency with which disruptions occur in manufacturing practice.