Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal

Frank Meisel () and Christian Bierwirth ()
Additional contact information
Frank Meisel: Martin-Luther-University Halle-Wittenberg
Christian Bierwirth: Martin-Luther-University Halle-Wittenberg

A chapter in Operations Research Proceedings 2005, 2006, pp 105-110 from Springer

Abstract: Abstract This talk deals with the combination of two decision problems, which occur consecutively while planning the charge and discharge operations of container ships in container terminals. The Berth Allocation Problem (BAP) considers the allocation of ships to berths in the course of time. The Crane Assignment Problem (CAP) addresses the assignment of quay cranes to ships. We provide a heuristic approach for the integrated solution of these problems and present computational results based on real world data.

Keywords: Schedule Algorithm; Idle Time; Container Terminal; Quay Crane; Discharge Operation (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:oprchp:978-3-540-32539-0_17

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_17

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().