Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness.

Mohammed Sbihi (1) , Christophe Varnier (1)

1 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)

This paper considers a single machine scheduling problem with several maintenances periods. Specially, two situations are investigated. In the first one, maintenance periods are periodically fixed : maintenance is required after a periodic time interval. In the second one, the maintenance is not fixed but the maximum continuous working time of the machine which is allowed is determined. The objective is to minimize the maximum tardiness. These problems are known to be strongly NP-hard. We propose some dominance properties and an efficient heuristic. Branch-and-bound algorithms, in which the heuristics, the lower bounds and the dominance properties are incorporated, are proposed and tested computationally.

Mots clés: non resumable job; Scheduling; periodic maintenance; maximum tardiness; non resumable job.

Domaines: Automatique / Robotique

Mohammed Sbihi, Christophe Varnier. Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness.. Computers & Industrial Engineering, 2008, pp.830-840. ⟨10.1016/j.cie.2008.03.005⟩. ⟨hal-00280023⟩