Scheduling co-operating stacking cranes with predetermined container sequences

With the proliferation of multi-gantry automated stacking cranes, the already difficult crane scheduling problem in container terminals has become even more challenging. In this paper we present an efficient algorithm that can solve a sub-problem that arises in this context, namely the prioritizatio...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2016-03, Vol.201, p.70-85
Main Authors: Briskorn, Dirk, Angeloudis, Panagiotis
Format: Article
Language:English
Subjects:
Algorithms
Automated stacking cranes
Container terminals
Cranes
Efficient algorithm
Mathematical models
Movements
Polynomials
Scheduling
Shortest path representation
Stacking
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With the proliferation of multi-gantry automated stacking cranes, the already difficult crane scheduling problem in container terminals has become even more challenging. In this paper we present an efficient algorithm that can solve a sub-problem that arises in this context, namely the prioritization of crane gantry movements once 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 with exceptionally small run times.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2015.07.042