A scheduling method for Berth and Quay cranes |
| |
Authors: | Young-Man Park Kap Hwan Kim |
| |
Affiliation: | (1) Department of Industrial Engineering, Pusan National University, Changjeon-dong, Kumjeong-ku, Busan 609-735, Korea (e-mail: {ymanpark,kapkim}@pusan.ac.kr) , KR |
| |
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.
RID="*"
ID="*" This research has been supported in part by Brain Korea 21 Program (1999–2002).
Correspondence to: Y.-M. Park |
| |
Keywords: | : Scheduling – Transportation – Optimization – Container Terminal – Berth planning |
本文献已被 SpringerLink 等数据库收录! |
|