Angeloudis, P

Briskorn, D

English

Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry automated stacking cranes. In this paper we present an efficient algorithm solving a subproblem arising in this context, namely deciding the priority of cranes after transportation tasks have been assigned. We tackle this problem for both, twin crane setting and crossover crane setting, and develop graphical models and strongly polynomial algorithms accordingly. A series of experiments is carried out where it is shown that the method can produce optimum solutions within exceptionally small run times

Spiral - Imperial College Digital Repository

Scheduling co-operating stacking cranes with predetermined container sequences

Dirk Briskorn

Panagiotis Angeloudis

Crossref

Discrete Applied Mathematics

http://spiral.imperial.ac.uk/bitstream/10044/1/31870/2/15.07%20-%20PAPER%20-%20Scheduling%20co-operating%20stacking%20cranes%20with%20predetermined%20container%20sequences.pdf

Scheduling co-operating stacking cranes with predetermined container sequences

Abstract

Similar works

Full text

Available Versions

Spiral - Imperial College Digital Repository

Crossref