Scheduling reclaimers serving a stock pad at a coal terminal
Year of publication: |
February 2017
|
---|---|
Authors: | Kalinowski, Thomas ; Kapoor, Reena ; Savelsbergh, Martin W. P. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 1, p. 85-101
|
Subject: | Reclaimer scheduling | Stockyard management | Approximation algorithm | Computational complexity | Branch-and-bound | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Kohle | Coal |
-
A reclaimer scheduling problem arising in coal stockyard management
Angelelli, Enrico, (2016)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Minimizing the number of workers in a paced mixed-model assembly line
Delorme, Xavier, (2019)
- More ...
-
A reclaimer scheduling problem arising in coal stockyard management
Angelelli, Enrico, (2016)
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
- More ...