Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times

This article considers single-machine problems in which the actual processing time of a job is a function of its position in a sequence (i.e. position-dependent deterioration effects). In this model, a job is either accepted or rejected. If the job is accepted, it is processed on a single machine, but if the job is rejected, a penalty (cost) is imposed. The goal is to minimize the sum of the given scheduling objectives, including the makespan, the total completion time, the total absolute differences in completion times and the total absolute differences in waiting times of the accepted jobs and total rejection penalty of the rejected jobs. It is illustrated that these problems remain polynomially solvable under the proposed models. Finally, computational results demonstrate that the proposed algorithms can solve instances of various size problems in attractive times. An extension to the problems is offered by assuming time-dependent deterioration effects.