A Survey of Scheduling with Deterministic Machine Availability Constraints
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 no recent paper summarizes them. To be convenient for interested researchers, we make this survey. In this paper, complexity results, exact algorithms and approximation algorithms are surveyed in single machine, parallel machine, flow shop, open shop scheduling environment with different criteria. Finally we present some open problems and future research trends on this subject.
Scheduling problems Availability constraints Algorithms
Ying MA Chengbin CHU Chunrong ZUO
Hefei University of Technology,Hefei,China Hefei University of Technology,Hefei,China;Université de Technologie de Troyes,Troyes,France
国际会议
北京
英文
2007-05-30(万方平台首次上网日期,不代表论文的发表时间)