Minimizing crane times in pre-marshalling problems

Abstract

  The pre-marshalling problem has been extensively studied in recent years with the aim of minimizing the number of movements needed to rearrange a bay of containers. Time is a more realistic objective for measuring process efficiency, and we show that it does not correlate with the number of movements. As a result, we study the problem of minimizing crane times and develop two exact approaches to solve it: an integer linear model, and a branch and bound algorithm, with new upper and lower bounds, dominance criteria, and a heuristic procedure, to provide optimal solutions for problems of practical size.

Original document

The different versions of the original document can be found in:

• http://dx.doi.org/10.1016/j.tre.2020.101917,

https://pub.uni-bielefeld.de/record/2943589 under the license https://rightsstatements.org/page/InC/1.0/

• https://api.elsevier.com/content/article/PII:S1366554519311949?httpAccept=text/xml,

https://api.elsevier.com/content/article/PII:S1366554519311949?httpAccept=text/plain,

http://dx.doi.org/10.1016/j.tre.2020.101917 under the license https://www.elsevier.com/tdm/userlicense/1.0/

• https://www.sciencedirect.com/science/article/pii/S1366554519311949,

https://academic.microsoft.com/#/detail/3017633880