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...

We analyze a number of due date assignment problems with the weighted number of tardy jobs objective and show that these problems can be solved in O(n) time by dynamic programming. We show that the effects of learning or the effects of past-sequence-dependent setup times can be incorporated into the problem formulation at no additional computational cost. We also show that some single-machine d...