| Title |
|
A reclaimer scheduling problem arising in coal stockyard management |
|
|
| Publication Date |
|
| Author(s) |
|
| Type of document |
|
| Language |
|
| Entity Type |
|
| Publisher |
|
| Place of publication |
|
| DOI |
|
10.1007/s10951-015-0436-y |
|
|
| UNE publication id |
|
| Abstract |
|
We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm. |
|
|
| Link |
|
| Citation |
|
Journal of Scheduling, 19(5), p. 563-582 |
|
|
| ISSN |
|
| Start page |
|
| End page |
|