Kalinowski, Thomas; Kapoor, Reena; Savelsbergh, Martin W P

Author(s)

Kalinowski, Thomas

Kapoor, Reena

Savelsbergh, Martin W P

Publication Date

2017-02

Abstract

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.

Citation

Journal of Scheduling, 20(1), p. 85-101

ISSN

1099-1425

1094-6136

Link

https://hdl.handle.net/1959.11/26791

Publisher

Springer New York LLC

Title

Scheduling reclaimers serving a stock pad at a coal terminal

Type of document

Journal Article

Entity Type

Publication

Author(s)	Kalinowski, Thomas Kapoor, Reena Savelsbergh, Martin W P
Publication Date	2017-02
Abstract	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.
Citation	Journal of Scheduling, 20(1), p. 85-101
ISSN	1099-1425 1094-6136
Link	https://hdl.handle.net/1959.11/26791
Publisher	Springer New York LLC
Title	Scheduling reclaimers serving a stock pad at a coal terminal
Type of document	Journal Article
Entity Type	Publication

Scheduling reclaimers serving a stock pad at a coal terminal

Files: