Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.cie.2009.04.014 | Computers & Industrial Engineering |
Keywords | Field | DocType |
availability constraints,recent paper,algorithms,single machine,approximation algorithm,flow shop,job shop scheduling environment,various deterministic scheduling problem,scheduling problems,open shop,parallel machine,deterministic machine availability constraint,recent year,availability constraint,scheduling problem,job shop scheduling,preventive maintenance | Lottery scheduling,Open shop,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling | Journal |
Volume | Issue | ISSN |
58 | 2 | Computers & Industrial Engineering |
Citations | PageRank | References |
119 | 3.59 | 54 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ying Ma | 1 | 119 | 3.59 |
| Chengbin Chu | 2 | 1486 | 126.84 |
| Chun-rong Zuo | 3 | 143 | 5.22 |