Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26792| Title: | A reclaimer scheduling problem arising in coal stockyard management | Contributor(s): | Angelelli, Enrico (author); Kalinowski, Thomas (author) ; Kapoor, Reena (author); Savelsbergh, Martin W P (author) |
Publication Date: | 2016-10 | Early Online Version: | 2015-06-10 | DOI: | 10.1007/s10951-015-0436-y | Handle Link: | https://hdl.handle.net/1959.11/26792 | 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. | Publication Type: | Journal Article | Grant Details: | ARC/LP1102000524 | Source of Publication: | Journal of Scheduling, 19(5), p. 563-582 | Publisher: | Springer New York LLC | Place of Publication: | United States of America | ISSN: | 1099-1425 1094-6136 |
Fields of Research (FoR) 2008: | 010303 Optimisation | Fields of Research (FoR) 2020: | 490304 Optimisation | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Socio-Economic Objective (SEO) 2020: | 280118 Expanding knowledge in the mathematical sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
|---|---|
| Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
| File | Size | Format |
|---|
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.