File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Quay crane scheduling in container terminals

TitleQuay crane scheduling in container terminals
Authors
KeywordsContainer terminal
Heuristic
Quay crane scheduling
Issue Date2006
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.asp
Citation
Engineering Optimization, 2006, v. 38 n. 6, p. 723-737 How to Cite?
AbstractThe problem of scheduling identical quay cranes moving along a common linear rail to handle containers for a ship is studied. The ship has a number of container-stacking compartments called bays, and only one quay crane can work on a bay at the same time. The objective of the scheduling problem is to find the work schedule for each quay crane which minimizes the ships stay time in port. Finding the optimal solution of the scheduling problem is computationally intractable and a heuristic is proposed to solve it. The heuristic first decomposes the difficult multi-crane scheduling problem into easier subproblems by partitioning the ship into a set of non-overlapping zones. The resulting subproblems for each possible partition are solved optimally by a simple rule. An effective algorithm for finding tight lower bounds is developed by modifying and enhancing an effective lower-bounding procedure proposed in the literature. Computational experiments were carried out to evaluate the performance of the heuristic on a set of test problems randomly generated based on typical terminal operations data. The computational results show that the heuristic can indeed find effective solutions for the scheduling problem, with the heuristic solutions on average 4.8% above their lower bounds.
Persistent Identifierhttp://hdl.handle.net/10722/74591
ISSN
2015 Impact Factor: 1.38
2015 SCImago Journal Rankings: 0.866
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_HK
dc.contributor.authorMak, KLen_HK
dc.date.accessioned2010-09-06T07:02:51Z-
dc.date.available2010-09-06T07:02:51Z-
dc.date.issued2006en_HK
dc.identifier.citationEngineering Optimization, 2006, v. 38 n. 6, p. 723-737en_HK
dc.identifier.issn0305-215Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/74591-
dc.description.abstractThe problem of scheduling identical quay cranes moving along a common linear rail to handle containers for a ship is studied. The ship has a number of container-stacking compartments called bays, and only one quay crane can work on a bay at the same time. The objective of the scheduling problem is to find the work schedule for each quay crane which minimizes the ships stay time in port. Finding the optimal solution of the scheduling problem is computationally intractable and a heuristic is proposed to solve it. The heuristic first decomposes the difficult multi-crane scheduling problem into easier subproblems by partitioning the ship into a set of non-overlapping zones. The resulting subproblems for each possible partition are solved optimally by a simple rule. An effective algorithm for finding tight lower bounds is developed by modifying and enhancing an effective lower-bounding procedure proposed in the literature. Computational experiments were carried out to evaluate the performance of the heuristic on a set of test problems randomly generated based on typical terminal operations data. The computational results show that the heuristic can indeed find effective solutions for the scheduling problem, with the heuristic solutions on average 4.8% above their lower bounds.en_HK
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.aspen_HK
dc.relation.ispartofEngineering Optimizationen_HK
dc.subjectContainer terminalen_HK
dc.subjectHeuristicen_HK
dc.subjectQuay crane schedulingen_HK
dc.titleQuay crane scheduling in container terminalsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0305-215X&volume=38&issue=6&spage=723&epage=737&date=2006&atitle=Quay+Crane+Scheduling+in+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.1080/03052150600691038en_HK
dc.identifier.scopuseid_2-s2.0-33745586759en_HK
dc.identifier.hkuros129187en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33745586759&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume38en_HK
dc.identifier.issue6en_HK
dc.identifier.spage723en_HK
dc.identifier.epage737en_HK
dc.identifier.isiWOS:000238615600006-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridNg, WC=7401613494en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.citeulike715927-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats