Volltext-Downloads (blau) und Frontdoor-Views (grau)

Solving the single crane scheduling at rail transshipment yards

  • We consider single-crane scheduling at rail transshipment yards, in which gantry cranes move containers between trains, trucks and a storage area. The single-crane scheduling problem arises at single-crane transshipment terminals and as a subproblem of the multiple-crane scheduling problem. We consider a makespan objective function, which is equivalent to minimizing the train dwell time in the yard, and introduce time windows for container moves, for example, as a customer service promise. Our proposed decomposition algorithm with integrated dynamic branch-and-cut or dynamic programming solves practically relevant instances within short time limits.

Export metadata

Additional Services

Search Google Scholar


Document Type:Article
Author:Alena OttoORCiD, Xiyu Li, Erwin PeschORCiD
Center:Center for Advanced Studies in Management (CASiM)
Parent Title (English):Discrete Applied Mathematics
Issue:15 July 2019
Year of Completion:2019
First Page:134
Last Page:147
Tag:Branch-and-cut; Crane scheduling; Transshipment yard; asmmetric traveling salesman problem with time windows; minimum completion time problem
Content Focus:Academic Audience
Peer Reviewed:Yes
Rankings:AJG Ranking / 2
VHB Ranking / A
SJR Ranking / Q2
Licence (German):License LogoUrheberrechtlich gesch├╝tzt