- Title
- Scheduling reclaimers serving a stock pad at a coal terminal
- Creator
- Kalinowski, Thomas; Kapoor, Reena; Savelsbergh, Martin W. P.
- Relation
- Funding BodyARCGrant NumberLP110200524 http://purl.org/au-research/grants/arc/LP110200524
- Relation
- Journal of Scheduling Vol. 20, Issue 1, p. 85-101
- Publisher Link
- http://dx.doi.org/10.1007/s10951-016-0495-8
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2017
- Description
- We study a variant of an abstract scheduling problem inspired by the management of reclaimers in the stockyard of a coal export terminal. We prove NP-completeness of the problem and formulate it as a mixed-integer program. We show that for a given reclaiming sequence, the problem can be solved in pseudo-polynomial time. In addition, we provide simple, constant-factor approximation algorithms as well as exact branch-and-bound algorithms. An extensive computational study analyzes the performance of the algorithms.
- Subject
- reclaimer scheduling; stockyard management; approximation algorithm; computational complexity; branch-and-bound
- Identifier
- http://hdl.handle.net/1959.13/1391689
- Identifier
- uon:33276
- Identifier
- ISSN:1094-6136
- Rights
- This is a post-peer-review, pre-copyedit version of an article published in Journal of Scheduling. The final authenticated version is available online at: http://dx.doi.org/ 10.1007/s10951-016-0495-8.
- Language
- eng
- Full Text
- Reviewed
- Hits: 1245
- Visitors: 1722
- Downloads: 305
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | ATTACHMENT02 | Author final version | 1016 KB | Adobe Acrobat PDF | View Details Download |