The crane scheduling problem: models and solution approaches
暂无分享,去创建一个
[1] Gilbert Laporte,et al. Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..
[2] Carlos F. Daganzo,et al. THE CRANE SCHEDULING PROBLEM , 1989 .
[3] Akio Imai,et al. BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .
[4] Y. Zhu,et al. Crane scheduling with non-crossing constraint , 2006, J. Oper. Res. Soc..
[5] Andrew Lim,et al. A m‐parallel crane scheduling problem with a non‐crossing constraint , 2007 .
[6] Erwin Kalvelagen,et al. LAGRANGIAN RELAXATION WITH GAMS , 2009 .
[7] Maria Flavia Monaco,et al. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach , 2007, Transp. Sci..
[8] Kap Hwan Kim,et al. A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..
[9] Gilbert Laporte,et al. A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal , 2006 .
[10] Andrew Lim,et al. A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..
[11] Lixin Miao,et al. Quay crane scheduling with non-interference constraints in port container terminals , 2008 .
[12] Carlos F. Daganzo,et al. A branch and bound solution method for the crane scheduling problem , 1990 .
[13] Pierre Hansen,et al. Variable neighborhood search for minimum cost berth allocation , 2003, Eur. J. Oper. Res..
[14] Lei Wang,et al. Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .
[15] Yi Zhu,et al. Crane scheduling using tabu search , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..
[16] Stefan Voß,et al. Operations research at container terminals: a literature update , 2007, OR Spectr..