File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Yard crane scheduling in port container terminals

TitleYard crane scheduling in port container terminals
Authors
KeywordsBranch and bound algorithm
Container terminal
Yard crane scheduling
Issue Date2005
PublisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/apm
Citation
Applied Mathematical Modelling, 2005, v. 29 n. 3, p. 263-276 How to Cite?
AbstractYard cranes are the most popular container handling equipment for loading containers onto or unloading containers from trucks in container yards of land scarce port container terminals. However, such equipment is bulky, and very often generates bottlenecks in the container flow in a terminal because of their slow operations. Hence, it is essential to develop good yard crane work schedules to ensure a high terminal throughput. This paper studies the problem of scheduling a yard crane to perform a given set of loading/unloading jobs with different ready times. The objective is to minimize the sum of job waiting times. A branch and bound algorithm is proposed to solve the scheduling problem optimally. Efficient and effective algorithms are proposed to find lower bounds and upper bounds. The performance of the proposed branch and bound algorithm is evaluated by a set of test problems generated based on real life data. The results show that the algorithm can find the optimal sequence for most problems of realistic sizes. © 2004 Elsevier Inc. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/74470
ISSN
2015 Impact Factor: 2.291
2015 SCImago Journal Rankings: 1.318
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_HK
dc.contributor.authorMak, KLen_HK
dc.date.accessioned2010-09-06T07:01:39Z-
dc.date.available2010-09-06T07:01:39Z-
dc.date.issued2005en_HK
dc.identifier.citationApplied Mathematical Modelling, 2005, v. 29 n. 3, p. 263-276en_HK
dc.identifier.issn0307-904Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/74470-
dc.description.abstractYard cranes are the most popular container handling equipment for loading containers onto or unloading containers from trucks in container yards of land scarce port container terminals. However, such equipment is bulky, and very often generates bottlenecks in the container flow in a terminal because of their slow operations. Hence, it is essential to develop good yard crane work schedules to ensure a high terminal throughput. This paper studies the problem of scheduling a yard crane to perform a given set of loading/unloading jobs with different ready times. The objective is to minimize the sum of job waiting times. A branch and bound algorithm is proposed to solve the scheduling problem optimally. Efficient and effective algorithms are proposed to find lower bounds and upper bounds. The performance of the proposed branch and bound algorithm is evaluated by a set of test problems generated based on real life data. The results show that the algorithm can find the optimal sequence for most problems of realistic sizes. © 2004 Elsevier Inc. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier Inc. The Journal's web site is located at http://www.elsevier.com/locate/apmen_HK
dc.relation.ispartofApplied Mathematical Modellingen_HK
dc.rightsApplied Mathematical Modelling. Copyright © Elsevier Inc.en_HK
dc.subjectBranch and bound algorithmen_HK
dc.subjectContainer terminalen_HK
dc.subjectYard crane schedulingen_HK
dc.titleYard crane scheduling in port container terminalsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0307-904X&volume=29&spage=263&epage=276&date=2005&atitle=Yard+crane+scheduling+in+port+container+terminalsen_HK
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.authorityNg, WC=rp00160en_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.apm.2004.09.009en_HK
dc.identifier.scopuseid_2-s2.0-11444266631en_HK
dc.identifier.hkuros99318en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-11444266631&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume29en_HK
dc.identifier.issue3en_HK
dc.identifier.spage263en_HK
dc.identifier.epage276en_HK
dc.identifier.isiWOS:000226632500004-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridNg, WC=7401613494en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.citeulike9390195-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats