Rescheduling problems with deteriorating jobs under disruptions

Abstract

a b s t r a c tIn this paper, we consider two single-machine rescheduling problems with linear deteriorating jobs under disruption. By a deteriorating jobs, we mean that the actual processing time of the job is an increasing function of its starting time. The two problems correspond to two different increasing linear function. Rescheduling means a set of original jobs has already been scheduled to minimize some classical objective, then a new set of jobs arrives and creates a disruption. We consider the rescheduling problem to minimize the total completion time under a limit of the disruption from the original scheduling. For each problem, we consider two versions. For each version, the polynomial algorithms are proposed, respectively.

Single-machine rescheduling problems with learning effect under disruptions

“…Yuan and Mu [26] developed a single machine rescheduling problem with release dates to minimize makespan under the maximum sequence disruption. While, Zhao and Tang [28] studied two single-machine rescheduling problems with linear deteriorating jobs under a disruption to minimize the total completion time, which can be solved in polynomial time. Liu and Young [16] provided three approximation algorithms to study a single-machine rescheduling problem to minimize some cost objectives while the rescheduled jobs without excessively disrupting the original schedule.…”

Rescheduling Rework Jobs on Single Machine locked by initial loads

“…The cost may increase as the processing time of new jobs decreases. Some variants of the above problems have been dealt with by Zhao et al [9] who considered the case of deteriorating jobs. Hoogeveen et al [10] researched that the initial schedule of old jobs is assumed to minimize the total setup time.…”

Single-Machine Scheduling with Job Rejection, Deteriorating Effects, and Deteriorating Maintenance Activities

“…The corresponding scheduling problems have received considerable research attention. For reviews of scheduling problems involving the learning effect, the reader may refer to Cheng and Wang [1], Cheng et al [2,3], Janiak and Rudek [4][5][6], Kuo et al [7], Lee and Lai [8], Rudek [9], and Yin et al [10,11], while for reviews of research on scheduling with job deterioration, the reader may refer to Bachman et al [12,13], Inderfurth et al [14], Janiak and Kovalyov [15], Mazdeh et al [16], Yin et al [17][18][19], and Zhao and Tang [20]. For studies considering a mixed form of both learning and deterioration, we refer the reader to Cheng et al [21], Wang [22,23], Wang and Cheng [24], Wang et al [25][26][27], Yang and Kuo [28], and Yin and Xu [29].…”