Show simple item record

dc.contributor.authorLi, Wenkaien_US
dc.contributor.authorWu, Yongen_US
dc.contributor.authorPetering, M.en_US
dc.contributor.authorGoh, Marken_US
dc.contributor.authorde Souza, Roberten_US
dc.date.accessioned2017-05-03T15:54:48Z
dc.date.available2017-05-03T15:54:48Z
dc.date.issued2009en_US
dc.date.modified2012-02-10T02:21:49Z
dc.identifier.issn03772217en_US
dc.identifier.doi10.1016/j.ejor.2008.08.019en_US
dc.identifier.urihttp://hdl.handle.net/10072/36406
dc.description.abstractContainer 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.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_US
dc.format.extent342738 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_US
dc.publisherElsevieren_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofstudentpublicationNen_US
dc.relation.ispartofpagefrom165en_US
dc.relation.ispartofpageto172en_US
dc.relation.ispartofissue1en_US
dc.relation.ispartofjournalEuropean Journal of Operational Researchen_US
dc.relation.ispartofvolume198en_US
dc.rights.retentionYen_US
dc.subject.fieldofresearchOptimisationen_US
dc.subject.fieldofresearchLogistics and Supply Chain Managementen_US
dc.subject.fieldofresearchcode010303en_US
dc.subject.fieldofresearchcode150309en_US
dc.titleDiscrete time model and algorithms for container yard crane schedulingen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.rights.copyrightCopyright 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.en_US
gro.date.issued2009
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record