Skip to main content
Erschienen in: Journal of Scheduling 1/2017

23.09.2016

Scheduling reclaimers serving a stock pad at a coal terminal

verfasst von: Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

Erschienen in: Journal of Scheduling | Ausgabe 1/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Angelelli, E., Kalinowski, T., Kapoor, R., & Savelsbergh, M. (2015). A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling. In press. doi:10.1007/s10951-015-0436-y. Angelelli, E., Kalinowski, T., Kapoor, R., & Savelsbergh, M. (2015). A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling. In press. doi:10.​1007/​s10951-015-0436-y.
Zurück zum Zitat Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627.CrossRef Bierwirth, C., & Meisel, F. (2010). A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202(3), 615–627.CrossRef
Zurück zum Zitat Hu, D., & Yao, Z. (2012). Stacker-reclaimer scheduling in a dry bulk terminal. International Journal of Computer Integrated Manufacturing, 25(11), 1047–1058.CrossRef Hu, D., & Yao, Z. (2012). Stacker-reclaimer scheduling in a dry bulk terminal. International Journal of Computer Integrated Manufacturing, 25(11), 1047–1058.CrossRef
Zurück zum Zitat Kim, K., & Kim, K. (1999). A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics, 59(1), 425–433. Kim, K., & Kim, K. (1999). A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics, 59(1), 425–433.
Zurück zum Zitat Kim, K., & Kim, K. (2003). Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals. Naval Research Logistics (NRL), 50(5), 498–514.CrossRef Kim, K., & Kim, K. (2003). Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals. Naval Research Logistics (NRL), 50(5), 498–514.CrossRef
Zurück zum Zitat Legato, P., Trunfio, R., & Meisel, F. (2012). Modeling and solving rich quay crane scheduling problems. Computers and Operations Research, 39(9), 2063–2078.CrossRef Legato, P., Trunfio, R., & Meisel, F. (2012). Modeling and solving rich quay crane scheduling problems. Computers and Operations Research, 39(9), 2063–2078.CrossRef
Zurück zum Zitat Ng, W. (2005). Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research, 164(1), 64–78.CrossRef Ng, W. (2005). Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research, 164(1), 64–78.CrossRef
Zurück zum Zitat Ng, W., & Mak, K. (2005a). An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Engineering Optimization, 37(8), 867–877.CrossRef Ng, W., & Mak, K. (2005a). An effective heuristic for scheduling a yard crane to handle jobs with different ready times. Engineering Optimization, 37(8), 867–877.CrossRef
Zurück zum Zitat Ng, W., & Mak, K. (2005b). Yard crane scheduling in port container terminals. Applied Mathematical Modelling, 29(3), 263–276.CrossRef Ng, W., & Mak, K. (2005b). Yard crane scheduling in port container terminals. Applied Mathematical Modelling, 29(3), 263–276.CrossRef
Zurück zum Zitat Sun, D., & Tang, L.(2013). Benders approach for the raw material transportation scheduling problem in steel industry. In 10th IEEE international conference on control and automation (ICCA) (pp. 481–484). Sun, D., & Tang, L.(2013). Benders approach for the raw material transportation scheduling problem in steel industry. In 10th IEEE international conference on control and automation (ICCA) (pp. 481–484).
Zurück zum Zitat Zhang, C., Wan, Y.-W., Liu, J., & Linn, R. J. (2002). Dynamic crane deployment in container storage yards. Transportation Research Part B: Methodological, 36(6), 537–555.CrossRef Zhang, C., Wan, Y.-W., Liu, J., & Linn, R. J. (2002). Dynamic crane deployment in container storage yards. Transportation Research Part B: Methodological, 36(6), 537–555.CrossRef
Metadaten
Titel
Scheduling reclaimers serving a stock pad at a coal terminal
verfasst von
Thomas Kalinowski
Reena Kapoor
Martin W. P. Savelsbergh
Publikationsdatum
23.09.2016
Verlag
Springer US
Erschienen in
Journal of Scheduling / Ausgabe 1/2017
Print ISSN: 1094-6136
Elektronische ISSN: 1099-1425
DOI
https://doi.org/10.1007/s10951-016-0495-8

Weitere Artikel der Ausgabe 1/2017

Journal of Scheduling 1/2017 Zur Ausgabe