Elsevier

Discrete Applied Mathematics

Volume 264, 15 July 2019, Pages 134-147
Discrete Applied Mathematics

Solving the single crane scheduling problem at rail transshipment yards

https://doi.org/10.1016/j.dam.2018.07.021Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Crane scheduling
Transshipment yard
Branch-and-cut
Asymmetric traveling salesman problem with time windows
Minimum completion time problem

Cited by (0)