Quay crane scheduling for an indented berth

Engineering Optimization

Volumn 43, Issue 9, 2011, Pages 985-998

  Lee, Der Horng ^a   Chen, Jiang Hang ^a   Cao, Jin Xin ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b INNER MONGOLIA UNIVERSITY   (China)

Author keywords

heuristic; indented berth; quay crane scheduling; Tabu search

Indexed keywords

COMPUTATIONAL RESULTS; CONTAINER TERMINAL; HEURISTIC; INDENTED BERTH; MIXED INTEGER PROGRAMMING MODEL; QUAY CRANE SCHEDULING; SAFETY DISTANCES; TABU SEARCH HEURISTIC;

COMPUTER PROGRAMMING; CRANES; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PORT TERMINALS; SCHEDULING;

TABU SEARCH;

EID: 84860405482     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/0305215X.2010.532551     Document Type: Article

References (13)

1. Bierwirth, C. and Meisel, F., 2009. A fast heuristic for quay crane scheduling with interference. Journal of Scheduling, 12 (4), 345-360.
2. Bierwirth, C. and Meisel, F., 2010.Asurvey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 202 (3), 615-627.
3. Daganzo, C.F., 1989. The crane scheduling problem. Transportation Research: Part B - Methodological, 23 (3), 159-175.
4. Imai, A., et al., 2007. Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 179 (2), 579-593.
5. Kim, K.H., and Park,Y.M., 2004.Acrane scheduling method for port container terminals. European Journal of Operational Research, 156 (3), 752-768.
6. Lee, D.H.,Wang, H.Q., and Miao, L.X., 2008. Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E-Logistics and Transportation Review 44 (1), 124-135.
7. Lim, A., Rodrigues, B., and Xu, Z., 2004. Approximation schemes for the crane scheduling problem. In: T. Hagerup and J. Katajainen, eds. 9th Scandinavian workshop on algorithm theory, 8-10 July, Humbleback, Denmark. Berlin: (SWAT 2004), Springer-Verlag, pp. 323-335.
8. Moccia, L., et al., 2006.A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics, 53 (1), 45-59.
9. Peterkofsky, R.I. and Daganzo, C.F., 1990. A branch and bound solution method for the crane scheduling problem. Transportation Research: Part B - Methodological, 24 (3), 159-172.
10. Sammarra, M., et al., 2007.A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling, 10 (4), 327-336.
11. Tavakkoli-Moghaddam, R., et al., 2009. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Computers & Industrial Engineering, 56 (1), 241-248.
12. UNCTAD, 2008. Review of maritime transport. NewYork: United Nations.
13. Zhu,Y. and Lim, A., 2006. Crane scheduling with non-crossing constraint. Journal of the Operational Research Society, 57 (12), 1464-1471.