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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
RID="*"
ID="*" This research has been supported in part by Brain Korea 21 Program (1999–2002).
Correspondence to: Y.-M. Park
Rights and permissions
About this article
Cite this article
Park, YM., Kim, K. A scheduling method for Berth and Quay cranes. OR Spectrum 25, 1–23 (2003). https://doi.org/10.1007/s00291-002-0109-z
Issue Date:
DOI: https://doi.org/10.1007/s00291-002-0109-z