Please use this identifier to cite or link to this item:
Title: A continuous time model for multiple yard crane scheduling with last minute job arrivals
Authors: Li, W.
Goh, M. 
Wu, Y.
Petering, M.E.H.
De Souza, R.
Wu, Y.C.
Keywords: Container yard operations
Continuous time
Last minute jobs
Rolling-horizon algorithm
Issue Date: 2012
Citation: Li, W., Goh, M., Wu, Y., Petering, M.E.H., De Souza, R., Wu, Y.C. (2012). A continuous time model for multiple yard crane scheduling with last minute job arrivals. International Journal of Production Economics 136 (2) : 332-343. ScholarBank@NUS Repository.
Abstract: Container terminal (CT) operations are often bottlenecked by slow YC (yard crane) movements. Efficient YC scheduling to reduce the PM waiting time is therefore critical in increasing a CTs throughput. This paper develops an efficient continuous time MILP model for YC scheduling. The model treats realistic operational constraints such as multiple inter-crane interference, fixed YC separation distances, simultaneous container storage/retrievals, realistic YC acceleration/deceleration stages and gantry time, and require far fewer integer variables than previous work. The model significantly improves the solution quality compared to the existing discrete time models and other heuristics found in the literature. Using heuristics and a rolling-horizon algorithm, our model can solve actual container yard (CY) problems quickly and robustly in polynomial time. Also, to cope with the last minute container arrivals which can disrupt routine CT operations, two methods for handling these last minute job insertions are discussed and compared. © 2011 Elsevier B.V. All rights reserved.
Source Title: International Journal of Production Economics
ISSN: 09255273
DOI: 10.1016/j.ijpe.2011.12.020
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 14, 2019


checked on Feb 5, 2019

Page view(s)

checked on Jan 13, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.