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 research has been supported in part by Brain Korea 21 Program (1999–2002).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown GG, Lawphongpanich S, Thurman KP (1995) Optimizing ship Berthing. Naval Research Logistics 41: 1–15
Daganzo CF (1989) The crane scheduling problem. Transportation Research 23B(3): 159–175
Geoffrion M (1974) Lagrangean relaxation for integer programming. Mathematical Programming Study 2: 82–114
Held M, Wolfe P, Crowder HP (1974) Validation of sub-gradient optimization. Mathematical Programming 6: 62–88
Imai A, Nishimura E, Papadimitriou S (2001) The dynamic Berth allocation problem for a container port. Transportation Research (Part B) 35: 401–417
Lai KK, Shih K (1992) A study of container Berth allocation. Journal of Advanced Transportation 26(1): 45–60
Li C-L, Cai X, Lee C-Y (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30: 433–445
Lim (1998) The Berth planning problem. Operation Research Letters 22: 105–110
Murty KG (1992) Network programming. Prentice Hall, Englewood Cliffs, NJ
Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public Berth system by genetic algorithms. European Journal of Operational Research 131: 282–292
Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transportation Research 24B(3): 159–172
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Park, YM., Kim, K.H. (2005). A scheduling method for Berth and Quay cranes. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)