File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An effective heuristic for scheduling a yard crane to handle jobs with different ready times

TitleAn effective heuristic for scheduling a yard crane to handle jobs with different ready times
Authors
KeywordsContainer Terminal
Heuristics
Yard Crane Scheduling
Issue Date2005
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.asp
Citation
Engineering Optimization, 2005, v. 37 n. 8, p. 867-877 How to Cite?
AbstractIn land-constrained port container terminals, yard cranes are commonly used for handling containers in a container yard to load containers onto or unload containers from trucks. However, yard cranes are bulky, slow and need to move frequently between their work locations. As it is common that the container flow in a terminal is bottlenecked by yard crane operations, effective work schedules of yard cranes are needed to increase the terminal's throughput. This article studies the problem of scheduling a yard crane to perform a given set of container handling jobs with different ready times. The objective is to minimize the sum of job waiting times. It is noted that the scheduling problem is NP-complete. This research develops a heuristic to solve the scheduling problem and an algorithm to find lower bounds for benchmarking the schedules found by the heuristic. The performance of the heuristic is evaluated by a set of test problems generated on the basis of real-life terminal operations data. Indeed, the computational results show that the proposed heuristic can find effective solutions for the scheduling problem.
Persistent Identifierhttp://hdl.handle.net/10722/155883
ISSN
2015 Impact Factor: 1.38
2015 SCImago Journal Rankings: 0.866
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_US
dc.contributor.authorMak, KLen_US
dc.date.accessioned2012-08-08T08:38:10Z-
dc.date.available2012-08-08T08:38:10Z-
dc.date.issued2005en_US
dc.identifier.citationEngineering Optimization, 2005, v. 37 n. 8, p. 867-877en_US
dc.identifier.issn0305-215Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/155883-
dc.description.abstractIn land-constrained port container terminals, yard cranes are commonly used for handling containers in a container yard to load containers onto or unload containers from trucks. However, yard cranes are bulky, slow and need to move frequently between their work locations. As it is common that the container flow in a terminal is bottlenecked by yard crane operations, effective work schedules of yard cranes are needed to increase the terminal's throughput. This article studies the problem of scheduling a yard crane to perform a given set of container handling jobs with different ready times. The objective is to minimize the sum of job waiting times. It is noted that the scheduling problem is NP-complete. This research develops a heuristic to solve the scheduling problem and an algorithm to find lower bounds for benchmarking the schedules found by the heuristic. The performance of the heuristic is evaluated by a set of test problems generated on the basis of real-life terminal operations data. Indeed, the computational results show that the proposed heuristic can find effective solutions for the scheduling problem.en_US
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.aspen_US
dc.relation.ispartofEngineering Optimizationen_US
dc.subjectContainer Terminalen_US
dc.subjectHeuristicsen_US
dc.subjectYard Crane Schedulingen_US
dc.titleAn effective heuristic for scheduling a yard crane to handle jobs with different ready timesen_US
dc.typeArticleen_US
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_US
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_US
dc.identifier.authorityNg, WC=rp00160en_US
dc.identifier.authorityMak, KL=rp00154en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1080/03052150500323849en_US
dc.identifier.scopuseid_2-s2.0-31444432278en_US
dc.identifier.hkuros119042-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-31444432278&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume37en_US
dc.identifier.issue8en_US
dc.identifier.spage867en_US
dc.identifier.epage877en_US
dc.identifier.isiWOS:000233564400006-
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridNg, WC=7401613494en_US
dc.identifier.scopusauthoridMak, KL=7102680226en_US
dc.identifier.citeulike388097-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats