A scheduling method for Berth and Quay cranes

Young-Man Park () and Kap Hwan Kim ()
Additional contact information
Young-Man Park: Pusan National University
Kap Hwan Kim: Pusan National University

A chapter in Container Terminals and Automated Transport Systems, 2005, pp 159-181 from Springer

Abstract: Abstract This paper discusses a method for scheduling Berth and Quay cranes, which are critical resources in port container terminals. An integer programming model is formulated by considering various practical constraints. A two-phase solution procedure is suggested for solving the mathematical model. The first phase determines the Berthing position and time of each vessel as well as the number of cranes assigned to each vessel at each time segment. The subgradient optimization technique is applied to obtain a near-optimal solution of the first phase. In the second phase, a detailed schedule for each Quay crane is constructed based on the solution found from the first phase. The dynamic programming technique is applied to solve the problem of the second phase. A numerical experiment was conducted to test the performance of the suggested algorithms.

Keywords: Scheduling; Transportation; Optimization; Container Terminal; Berth planning (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (4)

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:sprchp:978-3-540-26686-0_7

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

DOI: 10.1007/3-540-26686-0_7

Access Statistics for this chapter

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