Discrete time model and algorithms for container yard crane scheduling

Full text for this resource is not available from the Research Repository.

Li, Wenkai, Wu, Yong, Petering, Matthew, Goh, Mark and de Souza, Robert (2009) Discrete time model and algorithms for container yard crane scheduling. European Journal of Operational Research, 198 (1). pp. 165-172. ISSN 0377-2217

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.

Dimensions Badge

Altmetric Badge

Item type Article
URI https://vuir.vu.edu.au/id/eprint/4411
DOI https://doi.org/10.1016/j.ejor.2008.08.019
Official URL http://www.sciencedirect.com/science?_ob=MImg&_ima...
Subjects Historical > SEO Classification > 8902 Computer Software and Services
Current > FOR Classification > 0102 Applied Mathematics
Historical > Faculty/School/Research Centre/Department > Institute for Logistics and Supply Chain Management (ILSCM)
Keywords ResPubID17495, scheduling, rolling-horizon algorithm, container yard, MILP
Citations in Scopus 105 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login