CAJ | 학술논문

在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小.当一个新的工件集到来时就会产生一些错位,决策者需要插入新工件到原来排序中而还不能过分打乱它们的顺序.该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;也研究了当工件加工时间相同或工件工期相同时,在错位量限制的条件下最小化误工和问题.对这些问题,给出了好的算法.
재단궤중신배서문제중,일개원시공건집이경배호순서,사득급정적목표함수최소.당일개신적공건집도래시취회산생일사착위,결책자수요삽입신공건도원래배서중이환불능과분타란타문적순서.해논문수선연구료당공건가공시간화공기상용시,재착위량한제적조건하최소화최대연지문제;야연구료당공건가공시간상동혹공건공기상동시,재착위량한제적조건하최소화오공화문제.대저사문제,급출료호적산법.
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 dj, pj are compatible; then we consider rescheduling the problem to minimize the total tardiness under a limit on the disruption constraints when pj = p or dj = d. For these problems,efficient algorithms are provided.