Single-machine due-window assignment problem with learning effect and deteriorating jobs

摘要

In this paper we consider a single-machine common due-window assignment scheduling problem with learning effect and deteriorating jobs. In this model, job processing times are defined by functions of their starting times and positions in the sequence. The window location and size, along with the associated job schedule that minimizes a certain cost function, are to be determined. This function is made up of costs associated with the window location, window size, earliness and tardiness. We show that the problem remains polynomially solvable under the proposed model.