Title
Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness
Abstract
This paper considers a single-machine scheduling problem with several maintenances periods. Specifically, 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.
Year
DOI
Venue
2008
10.1016/j.cie.2008.03.005
Computers & Industrial Engineering
Keywords
Field
DocType
periodic maintenance,maintenances period,single-machine scheduling problem,periodic time interval,branch-and-bound algorithm,lower bound,maximum tardiness,maximum continuous working time,maintenance period,single-machine scheduling,scheduling,flexible periodic maintenance,efficient heuristic,dominance property,branch and bound algorithm
Single-machine scheduling,Mathematical optimization,Heuristic,Tardiness,Job shop scheduling,Working time,Scheduling (computing),Heuristics,Periodic graph (geometry),Mathematics,Operations management
Journal
Volume
Issue
ISSN
55
4
Computers & Industrial Engineering
Citations 
PageRank 
References 
31
1.40
8
Authors
2
Name
Order
Citations
PageRank
Mohammed Sbihi1311.40
Christophe Varnier2719.09