File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Crane scheduling in container yards with inter-crane interference

TitleCrane scheduling in container yards with inter-crane interference
Authors
KeywordsContainer terminal
Heuristic
Transportation
Yard crane scheduling
Issue Date2005
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejor
Citation
European Journal Of Operational Research, 2005, v. 164 n. 1, p. 64-78 How to Cite?
AbstractThis paper examines the problem of scheduling multiple yard cranes to perform a given set of jobs with different ready times in a yard zone with only one bi-directional travelling lane. Due to sharing of the travelling lane among two or more yard cranes, inter-crane interference, a planned move of a yard crane blocked by the other yard cranes, may happen. The scheduling problem is formulated as an integer program. It is noted that the scheduling problem is NP-complete. This research develops a dynamic programming-based heuristic to solve the scheduling problem and an algorithm to find lower bounds for benchmarking the schedules found by the heuristic. Computational experiments are carried out to evaluate the performance of the heuristic and the results show that the heuristic can indeed find effective solutions for the scheduling problem, with the heuristic solutions on average 7.3% above their lower bounds. © 2004 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/74572
ISSN
2015 Impact Factor: 2.679
2015 SCImago Journal Rankings: 2.595
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_HK
dc.date.accessioned2010-09-06T07:02:39Z-
dc.date.available2010-09-06T07:02:39Z-
dc.date.issued2005en_HK
dc.identifier.citationEuropean Journal Of Operational Research, 2005, v. 164 n. 1, p. 64-78en_HK
dc.identifier.issn0377-2217en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74572-
dc.description.abstractThis paper examines the problem of scheduling multiple yard cranes to perform a given set of jobs with different ready times in a yard zone with only one bi-directional travelling lane. Due to sharing of the travelling lane among two or more yard cranes, inter-crane interference, a planned move of a yard crane blocked by the other yard cranes, may happen. The scheduling problem is formulated as an integer program. It is noted that the scheduling problem is NP-complete. This research develops a dynamic programming-based heuristic to solve the scheduling problem and an algorithm to find lower bounds for benchmarking the schedules found by the heuristic. Computational experiments are carried out to evaluate the performance of the heuristic and the results show that the heuristic can indeed find effective solutions for the scheduling problem, with the heuristic solutions on average 7.3% above their lower bounds. © 2004 Elsevier B.V. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ejoren_HK
dc.relation.ispartofEuropean Journal of Operational Researchen_HK
dc.rightsEuropean Journal of Operational Research. Copyright © Elsevier BV.en_HK
dc.subjectContainer terminalen_HK
dc.subjectHeuristicen_HK
dc.subjectTransportationen_HK
dc.subjectYard crane schedulingen_HK
dc.titleCrane scheduling in container yards with inter-crane interferenceen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0377-2217&volume=164&spage=64&epage=78&date=2005&atitle=Crane+scheduling+in+container+yards+with+inter-crane+interferenceen_HK
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_HK
dc.identifier.authorityNg, WC=rp00160en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.ejor.2003.11.025en_HK
dc.identifier.scopuseid_2-s2.0-10444233579en_HK
dc.identifier.hkuros107143en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-10444233579&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume164en_HK
dc.identifier.issue1en_HK
dc.identifier.spage64en_HK
dc.identifier.epage78en_HK
dc.identifier.isiWOS:000226350600006-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridNg, WC=7401613494en_HK
dc.identifier.citeulike9390196-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats