TY  - JOUR
U1  - Wissenschaftlicher Artikel
A1  - Otto, Alena
A1  - Li, Xiyu
A1  - Pesch, Erwin
T1  - Solving the single crane scheduling at rail transshipment yards
JF  - Discrete Applied Mathematics
N2  - 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.
KW  - Crane scheduling
KW  - Transshipment yard
KW  - Branch-and-cut
KW  - asmmetric traveling salesman problem with time windows
KW  - minimum completion time problem
Y1  - 2019
SN  - 0166-218X
SS  - 0166-218X
U6  - https://doi.org/10.1016/j.dam.2018.07.021
DO  - https://doi.org/10.1016/j.dam.2018.07.021
VL  - 264
IS  - 15 July 2019
SP  - 134
EP  - 147
ER  -