COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES

Due-window assignment and production scheduling problems are important issues in operations management. In this paper, the problems of common due-window assignment and scheduling of job-dependent deteriorating jobs and multiple deteriorating maintenance activities simultaneously on a single-machine are investigated. We assume that the machine may be subjected to several maintenance activities during the planning horizon. However, due to the restriction of budget of maintenance, the upper bound of the maintenance frequency on the machine is assumed to be known in advance. Moreover, we assume that the duration of each maintenance activity depends on the running time of the machine. Polynomial time algorithms for the all the studied problems are provided, where the objective is to simultaneously minimize the earliness, tardiness, due-window starting time, and due-window size costs.