相容工件系统的最小化最大延迟与误工和的重新排序

在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小．当一个新的工件集到来时就会产生一些错位,决策者需要插入新工件到原来排序中而还不能过分打乱它们的顺序．该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;也研究了当工件加工时间相同或工件工期相同时,在错位量限制的条件下最小化误工和问题．对这些问题,给出了好的算法．

Rescheduling to Minimize Maximum Lateness and Total Tardiness under Compatible Job Systems

In the rescheduling on a single machine,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.In this paper,we first consider the rescheduling problem to minimize the maximum lateness under a limit on the disruption constraints when d_j,p_j are compatible;then we consider rescheduling the problem to minimize the total tardiness under a limit on the disruption constraints when p_j=p or d_j=d.For these problems, efficient algorithms are provided.