zbMATH — the first resource for mathematics

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. (English) Zbl 1112.90031
Summary: We study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel-level and the berth-level models. With the same berth-level model, two heuristic methods are developed using different vessel-level models. Computational experiments show that the proposed approach is effective and efficient.

90B35 Deterministic scheduling theory in operations research
90C10 Integer programming
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI
[1] Daganzo, Transportation Res 23B pp 159– (1989)
[2] Daganzo, Transportation Res Record 1251 pp 1– (1990)
[3] Guan, Oper Res Lett 30 pp 343– (2002)
[4] Imai, J Adv Transportation 31 pp 75– (1997)
[5] Imai, Transportation Res 35B pp 401– (2001)
[6] Scheduling a production line to minimize maximum tardiness, Research Report No. 43, Management Science Research Project, University of California at Los Angeles, 1955.
[7] Lai, J Adv Transportation 26 pp 45– (1992)
[8] Legato, European J Oper Res 133 pp 537– (2001)
[9] Lenstra, Ann Discrete Math 7 pp 343– (1977)
[10] Murty, Decision Support Syst 39 pp 309– (2005)
[11] Nishimura, European J Oper Res 131 pp 282– (2001)
[12] Peterkofsky, Transportation Res 24B pp 159– (1990)
[13] Vis, European J Oper Res 147 pp 1– (2003)
[14] Resource planning in container storage yard, Ph.D. Thesis, Hong Kong University of Science and Technology, Hong Kong, 2000.
[15] Zhang, Transportation Res 37B pp 883– (2003)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.