A Note on Single-machine Scheduling with Position Deterioration and Common Due-window Assignment

In machine scheduling environments with deterioration phenomenon, the jobs processed later in the sequence require more time. By position deterioration, we mean that the processing time of a job is defined by an increasing function of its scheduled position in the sequence. In this paper, we study a single machine scheduling problem with position deterioration and common due-window assignment problem. Jobs completed within the due-window incur no penalties, Jobs completed before or after the due-window incur either earliness or tardiness penalties. An O(nlogn) algorithm was developed to find the optimal size and location of the due-window, so as to minimize a cost function based on earliness, tardiness, window size, and window location. We also give a numerical example.