Integrated discrete berth allocation and quay crane scheduling in port container terminals

References

• Daganzo , C. F. 1989 . The crane scheduling problem . Transportation Research – Part B: Methodological , 23 ( 3 ) : 159 – 175 .
   Web of Science ®Google Scholar
• Gen , M. and Cheng , R. 1996 . Genetic algorithms and engineering design , New York : Wiley .
   Google Scholar
• Guan , Y. P. 2002 . A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis . Operations Research Letters , 30 ( 5 ) : 343 – 350 .
   Web of Science ®Google Scholar
• Guan , Y. P. and Cheung , R. K. 2004 . The berth allocation problem: models and solution methods . OR Spectrum , 26 ( 1 ) : 75 – 92 .
   Web of Science ®Google Scholar
• Gunther , H. O. and Kim , K. H. 2006 . Container terminals and terminal operations . OR Spectrum , 28 ( 4 ) : 437 – 445 .
   Web of Science ®Google Scholar
• Imai , A. 2005 . Berth allocation in a container port: using a continuous location space approach . Transportation Research – Part B: Methodological , 39 ( 3 ) : 199 – 221 .
   Web of Science ®Google Scholar
• Imai , A. , Nagaiwa , K. and Tat , C. W. 1997 . Efficient planning of berth allocation for container terminals in Asia . Journal of Advanced Transportation , 31 ( 1 ) : 75 – 94 .
   Web of Science ®Google Scholar
• Imai , A. , Nishimura , E. and Papadimitriou , S. 2001 . The dynamic berth allocation problem for a container port . Transportation Research – Part B: Methodological , 35 ( 4 ) : 401 – 417 .
   Web of Science ®Google Scholar
• Imai , A. , Nishimura , E. and Papadimitriou , S. 2003 . Berth allocation with service priority . Transportation Research – Part B: Methodological , 37 ( 5 ) : 437 – 457 .
   Web of Science ®Google Scholar
• Kim , K. H. and Moon , K. C. 2003 . Berth scheduling by simulated annealing . Transportation Research – Part B: Methodological , 37 ( 6 ) : 541 – 560 .
   Web of Science ®Google Scholar
• Kim , K. H. and Park , Y. M. 2004 . A crane scheduling method for port container terminals . European Journal of Operational Research , 156 ( 3 ) : 752 – 768 .
   Web of Science ®Google Scholar
• Lai , K. K. and Shih , K. 1992 . A study of container berth allocation . Journal of Advanced Transportation , 26 ( 1 ) : 45 – 60 .
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Li , C. L. and Cai , X. Q. 1998 . Scheduling with multiple-job-on-one-processor pattern . Transactions of the Institute of Industrial Engineers , 30 ( 5 ) : 433 – 445 .
   Web of Science ®Google Scholar
• Lim , A. 1998 . The Berth planning problem . Operations Research Letters , 22 ( 2–3 ) : 105 – 110 .
   Web of Science ®Google Scholar
• Lim , A. 2004 . Crane scheduling with spatial constraints . Naval Research Logistics , 51 ( 3 ) : 386 – 406 .
   Web of Science ®Google Scholar
• Lim , A. , Rodrigues , B. and Xu , Z. 2004 . Approximation schemes for the crane scheduling problem. Algorithm theory – Swat 2004 . Lecture Notes in Computer Science , 3111 : 323 – 335 .
   Google Scholar
• Liu , J. Y. , Wan , Y. W. and Wang , L. 2006 . Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures . Naval Research Logistics , 53 ( 1 ) : 60 – 74 .
   Web of Science ®Google Scholar
• Moccia , L. 2006 . A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal . Naval Research Logistics , 53 ( 1 ) : 45 – 59 .
   Web of Science ®Google Scholar
• Ng , W. C. and Mak , K. L. 2006 . Quay crane scheduling in container terminals . Engineering Optimization , 38 ( 6 ) : 723 – 737 .
   Web of Science ®Google Scholar
• Nishimura , E. , Imai , A. and Papadimitriou , S. 2001 . Berth allocation planning in the public berth system by genetic algorithms . European Journal of Operational Research , 131 ( 2 ) : 282 – 292 .
   Web of Science ®Google Scholar
• Park , K. T. and Kim , K. H. 2002 . Berth scheduling for container terminals by using a sub-gradient optimization technique . Journal of the Operational Research Society , 53 ( 9 ) : 1054 – 1062 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Steenken , D. , Vob , S. and Stahlbock , R. 2004 . Container terminal operation and operations research – a classification and literature review . OR Spectrum , 26 ( 1 ) : 3 – 49 .
   Web of Science ®Google Scholar
• Zhu , Y. and Lim , A. 2006 . Crane scheduling with non-crossing constraint . Journal of the Operational Research Society , 57 ( 12 ) : 1464 – 1471 .
   Web of Science ®Google Scholar