In this study, we consider single-machine scheduling problems with past-sequence-dependent (denoted by psd) setup times in which the of jobs are proportional to length already processed jobs. Under common (CON) and slack (SLK) due-date assignment methods, prove that weighted sum earliness, tardiness minimization remains polynomially solvable. We also give some extensions for psd times.

This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of job depends on whether it is handled before or after activity. Under common and slack due date assignments, aim to find optimal schedule, position value (flow-allowance) so that linear weighted sum earliness, tardiness minimized, weights are location-dependent (position-depe...