Discrete time model and algorithms for container yard crane scheduling

Loading...
Thumbnail Image
File version
Author(s)
Li, Wenkai
Wu, Yong
Petering, MEH
Goh, Mark
de Souza, Robert
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2009
Size

342738 bytes

File type(s)

application/pdf

Location
License
Abstract

Container terminal (CT) operations are often bottlenecked by slow YC (yard crane) movements. PM (prime mover) queues in front of the YCs are common. Hence, efficient YC scheduling to reduce the PM waiting time is critical in increasing a CT's throughput. We develop an efficient model for YC scheduling by taking into account realistic operational constraints such as inter-crane interference, fixed YC separation distances and simultaneous container storage/retrievals. Among them, only inter-crane interference has ever been considered in the literature. The model requires far fewer integer variables than the literature by using bi-index decision variables. We show how the model can be solved quickly using heuristics and rolling-horizon algorithm, yielding close to optimal solutions in seconds. The solution quality and solution time are both better than the literature even with additional constraints considered. The proposed formulations and algorithms can be extended to other problems with time windows and space constraints.

Journal Title

European Journal of Operational Research

Conference Title
Book Title
Edition
Volume

198

Issue

1

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2009 Elsevier. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.

Item Access Status
Note
Access the data
Related item(s)
Subject

Optimisation

Persistent link to this record
Citation
Collections