Qi Cheng and Jiabao Zhang, Yanxia Guo
This study investigates the single-machine scheduling problem with common due-win -dow assignment, past-sequence-dependent (p-s-d) setup times and a deteriorating maintenance activity. By past-sequence-dependent setup times, we mean that the setup time of a job is proportional to the sum of the processing times of the jobs already processed. The objective is to minimize a cost function based on the earliness, tardiness, due-window starting time, and due-window size. It is shown that the problem is polynomial solvable.