Rescheduling on Identical Parallel Machines in the Presence of Machine Breakdowns

Abstract

This chapter considers a scheduling problem where a set of jobs has already been assigned to identical parallel machines that are subject to machine breakdowns with the objective of minimizing the total completion time. When machine breakdowns occur, the affected jobs need to be rescheduled with a view to not causing excessive schedule disruption with respect to the planned schedule. Schedule disruption is measured by the maximum time deviation or the total virtual tardiness, given that the completion time of any job in the planned schedule can be regarded as an implied due date for the job concerned. We focus on the trade-off between the total completion time of the adjusted schedule and schedule disruption by finding the set of Pareto-optimal solutions. We show that both variants of the problem are $\mathcal {NP}$-hard in the strong sense when the number of machines is considered to be part of the input, and $\mathcal {NP}$-hard when the number of machines is fixed. In addition, we develop pseudo-polynomial time algorithms for the two variants of the problem with a fixed number of machines, establishing that they are $\mathcal {NP}$-hard in the ordinary sense.