Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration

Abstract

This study considers single processor scheduling problems incorporating a rate-modifying activity (RMA) as well as processing time deterioration rates. The RMA fully restores the processing speed of a processor. As discussed in recent literature, the optimal position of an RMA for a single processor scheduling problem with the objective of makespan minimization, 1|p[j]A=α[j]S[j],rm|Cmax, where the processing time of a job (p[j]A:[j]denotesthejthposition)is determined by its start time (S[j])and position-dependent rate (α[j]), can be found easily. This study considers six variants of the problem: (P1) 1|p[j]A=p¯+α[j]S[j],rm|Cmax, (P1+)1|p[j]A=p¯+α[j]S[j],drm|Cmax, (P2) 1|p[i,j]A=pj+α[i]Sj,rm|Cmax, (P2+)1|p[i,j]A=pj+α[i]Sj,drm|Cmax, (P3) 1|pjA=αjSj,rm|Cmax, and (P3+)1|pjA=αjSj,drm|Cmax, where p¯ is the common basic processing time, pjis the basic processing time for job j, [i,j] is the job j scheduled at the ith position, and drm is the deteriorating RMA. We show that (P1) and (P1+), where the common basic processing time is considered, can be converted into the problem 1|p[j]A=α[j]S[j],rm|Cmax, so that the optimal position of the RMA can be found easily. In the other variants, the optimal sequences of jobs and positions of the RMA must be determined. In (P2) and (P2+), the basic processing time for each job (pj)is considered, whereas, in (P3) and (P3+), the deterioration rate depends not on the position of the job (α[j]) but on the job itself (αj). We show that the optimal schedules for (P2), (P2+) and (P3), (P3+) can be found by solving the assignment problems and the knapsack problems, respectively.