Scheduling flexible maintenance activities subject to job-dependent machine deterioration

• Published in: Journal of scheduling Vol. 15; no. 5; pp. 565 - 578
• Main Authors: Bock, Stefan, Briskorn, Dirk, Horbach, Andrei
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01.10.2012; Springer Science + Business Media; Springer Nature B.V
• Subjects: Artificial Intelligence; Breakdown; Breakdowns; Business and Management; Calculus of Variations and Optimal Control; Optimization; Completion time; Deterioration; Job shops; Maintenance; Maintenance management; Mathematical analysis; Minimization; Operations Research/Decision Theory; Optimization; Production scheduling; Schedules; Scheduling; Studies; Supply Chain Management; Machine deterioration; Machine scheduling; Maintenance
• ISSN: 1094-6136; 1099-1425
• DOI: 10.1007/s10951-011-0248-7

This paper considers single machine scheduling that integrates machine deterioration. The current maintenance state of the machine is determined by a maintenance level which drops by a certain, possibly job-dependent, amount while jobs are processed. A maintenance level of less than zero is associated with the machine’s breakdown and is therefore forbidden. Consequently, maintenance activities that raise the maintenance level again may become necessary and have to be scheduled additionally. In what follows, two general types of maintenance activities are distinguished. In the full maintenance case, maintenance activities are always executed until the machine has reached the maximum maintenance level. In contrast to this, the schedule in the partial maintenance case has to additionally determine the duration of maintenance activities. By combining both cases with regular objective functions such as minimization of maximum tardiness, minimization of the sum of completion times, or minimization of the number of tardy jobs, we obtain a new set of specific single-stage scheduling problems. Besides motivating and introducing these problems, we shall also analyze the computational complexity of general and specific cases.