@article{OttoLiPesch2019,
  author    = {Alena Otto and Xiyu Li and Erwin Pesch},
  title     = {Solving the single crane scheduling at rail transshipment yards},
  series   = {Discrete Applied Mathematics},
  volume    = {264},
  number    = {15 July 2019},
  issn      = {0166-218X},
  doi       = {10.1016/j.dam.2018.07.021},
  pages     = {134 -- 147},
  year      = {2019},
  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.},
  language  = {en}
}