TU Darmstadt / ULB / TUbiblio

Robust spotter scheduling in trailer yards

Tadumadze, Giorgi ; Boysen, Nils ; Emde, Simon (2020)
Robust spotter scheduling in trailer yards.
In: OR Spectrum : Quantitative Approaches in Management
doi: 10.1007/s00291-020-00599-5
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

Spotters (also denoted as switchers) are specialized terminal tractors, which are dedicated to the rapid maneuvering of semitrailers between parking lot and dock doors in large trailer yards. This paper is dedicated to spotter scheduling, i.e., the assignment of predefined trailer movements to a given fleet of spotters. The limited number of dock doors for loading and unloading is often the scarce resource during trailer processing, so that idle time of the bottleneck, e.g., caused by unforeseen delay in the yard, is to be avoided. In this setting, we aim to insert time buffers between any pair of subsequent jobs assigned to the same spotter, so that small delays are not propagated and subsequent jobs can still be executed in a timely manner. We formalize two versions of the resulting robust spotter scheduling problem and provide efficient algorithms for finding optimal solutions in polynomial time. Furthermore, we simulate delays during the execution of spotter schedules and show that the right robustness objective can greatly improve yard performance.

Typ des Eintrags: Artikel
Erschienen: 2020
Autor(en): Tadumadze, Giorgi ; Boysen, Nils ; Emde, Simon
Art des Eintrags: Bibliographie
Titel: Robust spotter scheduling in trailer yards
Sprache: Englisch
Publikationsjahr: 2020
Ort: Berlin ; Heidelberg ; New York
Verlag: Springer
Titel der Zeitschrift, Zeitung oder Schriftenreihe: OR Spectrum : Quantitative Approaches in Management
DOI: 10.1007/s00291-020-00599-5
URL / URN: https://link.springer.com/article/10.1007/s00291-020-00599-5
Zugehörige Links:
Kurzbeschreibung (Abstract):

Spotters (also denoted as switchers) are specialized terminal tractors, which are dedicated to the rapid maneuvering of semitrailers between parking lot and dock doors in large trailer yards. This paper is dedicated to spotter scheduling, i.e., the assignment of predefined trailer movements to a given fleet of spotters. The limited number of dock doors for loading and unloading is often the scarce resource during trailer processing, so that idle time of the bottleneck, e.g., caused by unforeseen delay in the yard, is to be avoided. In this setting, we aim to insert time buffers between any pair of subsequent jobs assigned to the same spotter, so that small delays are not propagated and subsequent jobs can still be executed in a timely manner. We formalize two versions of the resulting robust spotter scheduling problem and provide efficient algorithms for finding optimal solutions in polynomial time. Furthermore, we simulate delays during the execution of spotter schedules and show that the right robustness objective can greatly improve yard performance.

Freie Schlagworte: Yard operations, Truck scheduling, Terminal tractor scheduling, Robustness
Fachbereich(e)/-gebiet(e): 01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete > Fachgebiet Management Science / Operations Research
01 Fachbereich Rechts- und Wirtschaftswissenschaften
01 Fachbereich Rechts- und Wirtschaftswissenschaften > Betriebswirtschaftliche Fachgebiete
Hinterlegungsdatum: 19 Aug 2020 18:15
Letzte Änderung: 19 Jul 2024 07:34
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen