The crane scheduling problem

Carlos F. Daganzo

Transportation Research Part B: Methodological, 1989, vol. 23, issue 3, 159-175

Abstract: This paper examines crane scheduling for ports. It starts with a simple static case and uses it as a building block to develop a better understanding of the dynamic problem with berth length limitations. The paper assumes that ships are divided into holds and that (usually) only one crane can work on a hold at a time. Cranes can be moved freely from hold to hold, and ships cannot depart until all their holds have been handled. In the most general case, ships arrive at different times and must queue for berthing space if the berths are full. The objective is to turn around (serve) all the ships, while minimizing their aggregate cost of delay. The paper presents exact and approximate solution methods for crane scheduling. The approximation methods are based on optimality principles and are easy to implement. The exact methods can only be used for a few ships. The paper includes examples, performance tests, and a discussion of port operations and further work.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (63)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0191-2615(89)90001-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transb:v:23:y:1989:i:3:p:159-175

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part B: Methodological is currently edited by Fred Mannering

More articles in Transportation Research Part B: Methodological from Elsevier
Bibliographic data for series maintained by Catherine Liu ().