A survey of berth allocation and quay crane scheduling problems in container terminals

被引:601
作者
Bierwirth, Christian [1 ]
Meisel, Frank [1 ]
机构
[1] Univ Halle Wittenberg, Sch Business & Econ, D-4010 Halle, Germany
关键词
Container terminal operations; Berth allocation; Quay crane assignment; Quay crane scheduling; Problem classification; Integrated planning; OPERATIONS-RESEARCH; SEARCH ALGORITHM; BEAM SEARCH; PORT; OPTIMIZATION; MODEL; SHIP; HEURISTICS; INTEGRATION; MANAGEMENT;
D O I
10.1016/j.ejor.2009.05.031
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Due to the variety of technical equipments and terminal layouts, research has produced a Multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:615 / 627
页数:13
相关论文
共 116 条
[1]  
Ak A., 2006, SIMULTANEOUS BERTH Q
[2]  
[Anonymous], 2006, P 85 ANN M TRANSP RE
[3]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[4]   A multiple-crane-constrained scheduling problem in a container terminal [J].
Bish, EK .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 144 (01) :83-107
[5]  
Briano C, 2005, SIMULATION IN WIDER EUROPE, P199
[6]  
BROWN GG, 1994, NAV RES LOG, V41, P1, DOI 10.1002/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO
[7]  
2-L
[8]  
Brown GG, 1997, NAV RES LOG, V44, P301, DOI 10.1002/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO
[9]  
2-A
[10]   A queuing network model for the management of berth crane operations [J].
Canonaco, Pietro ;
Legato, Pasquale ;
Mazza, Rina M. ;
Musmanno, Roberto .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) :2432-2446