Scheduling co-operating stacking cranes with predetermined container sequences
Author(s)
Briskorn, D
Angeloudis, P
Type
Journal Article
Abstract
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.
Date Issued
2015-09-07
Date Acceptance
2015-07-27
Citation
Discrete Applied Mathematics, 2015, 201, pp.70-85
ISSN
1872-6771
Publisher
Elsevier
Start Page
70
End Page
85
Journal / Book Title
Discrete Applied Mathematics
Volume
201
Copyright Statement
© 2015, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
Sponsor
Engineering & Physical Science Research Council (EPSRC)
Grant Number
EP/L504683/1
Subjects
Science & Technology
Physical Sciences
Mathematics, Applied
Mathematics
Automated stacking cranes
Scheduling
Container terminals
Efficient algorithm
Shortest path representation
OPERATIONS-RESEARCH
YARD CRANE
ALGORITHM
TERMINALS
SYSTEMS
MODEL
Computation Theory & Mathematics
0102 Applied Mathematics
0802 Computation Theory And Mathematics
Publication Status
Published