The quay crane scheduling problem with time windows

Naval Research Logistics

Volumn 58, Issue 7, 2011, Pages 619-636

  Meisel, Frank ^a  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

container terminal; crane time windows; quay crane scheduling

Indexed keywords

COMPUTATIONAL INVESTIGATION; CONTAINER TERMINAL; CONTAINER TERMINAL OPERATORS; HANDLING TIME; HEURISTIC SOLUTIONS; LOADING AND UNLOADING; MATHEMATICAL FORMULATION; QUAY CRANE SCHEDULING; SCHEDULING TASKS; SPEED-UPS; TEST INSTANCES; TIME WINDOWS;

CONTAINERS; HEURISTIC METHODS; LOADING; MATHEMATICAL OPERATORS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS; SCHEDULING; SERVICE VESSELS; TREES (MATHEMATICS); UNLOADING;

CRANES;

EID: 80052282564     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20471     Document Type: Article

References (19)

1. C. Bierwirth, and, F. Meisel, A fast heuristic for quay crane scheduling with interference constraints, J Scheduling 12 (2009), 345-360.
2. C. Bierwirth, and, F. Meisel, A survey of berth allocation and quay crane scheduling problems in container terminals, Eur J Oper Res 202 (2010), 615-627.
3. C. F. Daganzo, The crane scheduling problem, Transport Res Part B 23 (1989), 159-175.
4. D. H. Jung, Y.-M. Park, B. K. Lee, K. H. Kim, and, K. R. Ryu, A quay crane scheduling method considering interference of yard cranes in container terminals, Proceedings of the 5th Mexican International Conference on Artificial Intelligence (MICAI 2006), Volume 4293 of LNCS, A. F. Gelbukh, C. A. Reyes García, (Editors), Springer, Berlin et al., 2006, pp. 461-471.
5. K. H. Kim, and, Y. M. Park, A crane scheduling method for port container terminals, Eur J Oper Res 156 (2004), 752-768.
6. D.-H. Lee, H. Q. Wang, and, L. Miao, Quay crane scheduling with handling priority in port container terminals, Eng Optim 40 (2008), 179-189.
7. D.-H. Lee, H. Q. Wang, and, L. Miao, Quay crane scheduling with non-interference constraints in port container terminals, Transport Res Part E 44 (2008), 124-135. (Pubitemid 47528130)
8. A. Lim, B. Rodrigues, and, Z. Xu, Approximation schemes for the crane scheduling problem, 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), Volume 3111 of LNCS, T. Hagerup, J. Katajainen, (Editors), Springer, Berlin et al., 2004, pp. 323-335.
9. A. Lim, B. Rodrigues, and, Z. Xu, A m-parallel crane scheduling problem with a non-crossing constraint, Naval Res Logist 54 (2007), 115-127. (Pubitemid 46383203)
10. J. Liu, Y.-W. Wan, and, L. Wang, Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures, Naval Res Logis 53 (2006), 60-74.
11. F. Meisel, Seaside operations planning in container terminals, Physica, Berlin et al., 2009.
12. F. Meisel, and, C. Bierwirth, A unified approach for the evaluation of quay crane scheduling models and algorithms, Comput Oper Res 38 (2011), 683-693.
13. L. Moccia, J.-F. Cordeau, M. Gaudioso, and, G. Laporte, A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal, Naval Res Logist 53 (2006), 45-59.
14. W. C. Ng, and, K. L. Mak, Quay crane scheduling in container terminals, Eng Optim 38 (2006), 723-737. (Pubitemid 43982685)
15. R. I. Peterkofsky, and, C. F. Daganzo, A branch and bound solution method for the crane scheduling problem, Transport Res Part B 24 (1990), 159-172.
16. M. Sammarra, J.-F. Cordeau, G. Laporte, and, M. F. Monaco, A tabu search heuristic for the quay crane scheduling problem, J Scheduling 10 (2007), 327-336. (Pubitemid 47501054)
17. R. Tavakkoli-Moghaddam, A. Makui, S. Salahi, M. Bazzazi, and, F. Taheri, An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports, Comput Ind Eng 56 (2009), 241-248.
18. UNCTAD, Review of maritime transport 2008, United Nations, New York and Geneva, 2008.
19. Y. Zhu, and, A. Lim, Crane scheduling with non-crossing constraint, J Oper Res Soc 57 (2006), 1464-1471. (Pubitemid 44771083)