A generalized classification scheme for crane scheduling with interference

被引:99
作者
Boysen, Nils [1 ]
Briskorn, Dirk [2 ]
Meisel, Frank [3 ]
机构
[1] Friedrich Schiller Univ Jena, Lehrstuhl Operat Management, Carl Zeiss Str 3, D-07743 Jena, Germany
[2] Berg Univ Wuppertal, Lehrstuhl Prod & Logist, Rainer Gruenter Str 21, D-42119 Wuppertal, Germany
[3] Christian Albrechts Univ Kiel, Lehrstuhl Supply Chain Managment, Olshausenstr 40, D-24098 Kiel, Germany
关键词
Crane scheduling; Non-crossing constraints; Classification; Survey; PORT CONTAINER TERMINALS; AUTOMATED STACKING CRANES; STORAGE-RETRIEVAL SYSTEM; NON-CROSSING CONSTRAINTS; TREE-SEARCH PROCEDURE; PROGRAMMING APPROACH; GENETIC ALGORITHM; BERTH ALLOCATION; NONINTERFERENCE CONSTRAINTS; STORAGE/RETRIEVAL SYSTEMS;
D O I
10.1016/j.ejor.2016.08.041
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Nowadays, many industries rely on cranes for efficiently executing storage and retrieval operations of goods. Areas of application are, for instance, container logistics in seaports and warehousing operations in automated storage and retrieval systems. Therefore, it is not astounding that plenty scientific papers on crane scheduling in many different yet closely related logistics settings have accumulated. In many of these problems, crane interference occurs. A prominent example is non-crossing constraints where cranes share a common pathway and cannot overtake each other. In order to structure this vast field of research, this paper provides a classification scheme for crane scheduling problems with crane interference. We apply this scheme to classify the existing literature, to determine the status-quo of complexity results, and to identify future research needs. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:343 / 357
页数:15
相关论文
共 130 条
[1]   Modeling and optimization of the intermodal terminal Mega Hub [J].
Alicke K. .
OR Spectrum, 2002, 24 (1) :1-17
[2]  
[Anonymous], 2012, REV MAR TRANSP 2012
[3]  
[Anonymous], 2012, Journal of Mechanical Systems for Transportation and Logistics
[4]  
Aron I., 2011, OPERATIONS RES COMPU, P93
[5]   Comparative evaluation of existing and innovative rail-road freight transport terminals [J].
Ballis, A ;
Golias, J .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2002, 36 (07) :593-611
[6]   A follow-up survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (03) :675-689
[7]   A survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627
[8]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[9]  
Blaiewicz J., 2007, HDB SCHEDULING
[10]   A tree search procedure for the container pre-marshalling problem [J].
Bortfeldt, Andreas ;
Forster, Florian .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 217 (03) :531-540