Integrating Ship Scheduling and Berth Allocation for Container Seaports with Channel Access

被引:3
作者
Bierwirth, Christian [1 ]
Corry, Paul [2 ]
机构
[1] Martin Luther Univ Halle Wittenberg, Halle, Germany
[2] Queensland Univ Technol, Brisbane, Qld, Australia
来源
DYNAMICS IN LOGISTICS | 2018年
关键词
D O I
10.1007/978-3-319-74225-0_18
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this talk we discuss the discrete berth allocation problem under channel access restrictions given by a river or sea gate through which calling vessels have to transit. We further outline an optimization concept for scheduling vessel movements in the channel related with the well known flowshop machine scheduling problem.
引用
收藏
页码:144 / 147
页数:4
相关论文
共 9 条
[1]   Model and heuristic for berth allocation in tidal bulk ports with stock level constraints [J].
Barros, Victor Hugo ;
Costa, Tarcisio Souza ;
Oliveira, Alexandre C. M. ;
Lorena, Luiz A. N. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) :606-613
[2]   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
[3]   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
[4]   Seaside operations in container terminals: literature overview, trends, and research directions [J].
Carlo, Hector J. ;
Vis, Iris F. A. ;
Roodbergen, Kees Jan .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2015, 27 (2-3) :224-262
[5]  
Kilby P., 2012, ICAPS 2012 P 22 INT
[6]  
Lalla-Ruiz E, 2016, TRANSPORT RES D-TR E, DOI [10.1016/j.trd2016.09.013, DOI 10.1016/J.TRD2016.09.013]
[7]  
Lin J, 2014, LECT NOTES COMPUT SC, V8631, P479, DOI 10.1007/978-3-319-11194-0_40
[8]  
Lubbecke E, 2014, 2014022 U AACH
[9]   Berth allocation with time-dependent physical limitations on vessels [J].
Xu, Dongsheng ;
Li, Chung-Lun ;
Leung, Joseph Y-T. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 216 (01) :47-56