Solving the single crane scheduling problem at rail transshipment yards
Under an Elsevier user license
open archive
Keywords
Crane scheduling
Transshipment yard
Branch-and-cut
Asymmetric traveling salesman problem with time windows
Minimum completion time problem
Cited by (0)
© 2018 Elsevier B.V.