A survey of scheduling with deterministic machine availability constraints

A survey of scheduling with deterministic machine availability constraints

0.00 Avg rating0 Votes
Article ID: iaor20101803
Volume: 58
Issue: 2
Start Page Number: 199
End Page Number: 211
Publication Date: Mar 2010
Journal: Computers and Industrial Engineering
Authors: , ,
Keywords: maintenance, repair & replacement
Abstract:

Various deterministic scheduling problems with availability constraints motivated by preventive maintenance attract more and more researchers. Many results involving this constraint have been published in recent years. But there is no recent paper to summarize them. To be convenient for interested researchers, we make this survey. In this paper, complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are surveyed briefly.

Reviews

Required fields are marked *. Your email address will not be published.