Gantry Crane Scheduling with Interference Constraints in Railway Container Terminals

References

• Ministry of Railway, China . Railway Statistical Bulletin . Retrieved May 1, 2012, http://www.china-mor.gov.cn/zwzc/tjxx/ . 2012 in Chinese .
   Google Scholar
• Sammarra , M. , Cordeau , J.-F. , Laporte , G. and Monaco , M.F. 2007 . A tabu search heuristic for the quay crane scheduling problem . Journal of Scheduling. , 10 ( 4-5 ) : 327 – 336 .
   Web of Science ®Google Scholar
• Boysen , N. , Jarhn , F. and Pesch , E. 2011 . Scheduling freight trains in Rail-Rail transshipment yards . Transportation Science. , 45 ( 2 ) : 199 – 211 .
   Web of Science ®Google Scholar
• T. Benna and M. Gronalt , Generic Simulation for rail-road container Terminals . in Proceedings of Winter Simulation Conference . Miami , FL , United states , 2008 , pp. 2656 – 2660 .
   Google Scholar
• P. Guo , W. Cheng and M. Zhang , Simulation on the operation influence by external factors for railway container logistic center . in Proceeding of International Conference of Logistics Engineering and Management . Chengdu , China , 2010 , pp. 2915 – 2922 .
   Google Scholar
• Kozan , E. 2000 . Optimising container transfers at multimodal terminals . Mathematical and Computer Modelling. , 31 ( 10-12 ) : 235 – 243 .
   Google Scholar
• Corry , P. and Kozan , E. 2006 . An assignment model for dynamic load planning of intermodal trains . Computers & Operations Research. , 33 ( 1 ) : 1 – 17 .
   Web of Science ®Google Scholar
• Jeong , B.J. and Kim , K.H. 2011 . Scheduling operations of a rail crane and container deliveries between rail and port terminals . Engineering Optimization. , 43 ( 6 ) : 597 – 613 .
   Web of Science ®Google Scholar
• Bierwirth , C. and Meisel , F. 2010 . A survey of berth allocation and quay crane scheduling problems in container terminals . European Journal of Operational Research. , 202 ( 3 ) : 615 – 627 .
   Web of Science ®Google Scholar
• Daganzo , C.F. 1989 . The crane scheduling problem . Transportation Research Part B: Methodological , 23 ( 3 ) : 159 – 175 .
   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
• Lim , A. , Rodrigues , B. , Xiao , F. and Zhu , Y. 2004 . Crane scheduling with spatial constraints . Naval Research Logistics. , 51 ( 3 ) : 386 – 406 .
   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
• Moccia , L. , Cordeau , J.-F. , Gaudioso , M. and Laporte , G. 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
• Bierwirth , C. and Meisel , F. 2009 . A fast heuristic for quay crane scheduling with interference constraints . Journal of Scheduling. , 12 ( 4 ) : 345 – 360 .
   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
• Lim , A. , Rodrigues , B. and Xu , Z. 2007 . A m-parallel crane scheduling problem with a non-crossing constraint . Naval Research Logistics. , 54 ( 2 ) : 115 – 127 .
   Web of Science ®Google Scholar
• Lee , D.-H. , Wang , H.Q. and Miao , L. 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
• Lee , D.-H. , Wang , H.Q. and Miao , L. 2008 . Quay crane scheduling with handling priority in port container terminals . Engineering Optimization. , 40 ( 2 ) : 179 – 189 .
   Web of Science ®Google Scholar
• Lee , D.-H. and Wang , H.Q. 2010 . An approximation algorithm for quay crane scheduling with handling priority in port container terminals . Engineering Optimization. , 42 ( 12 ) : 1151 – 1161 .
   Web of Science ®Google Scholar
• Legato , P. , Trunfio , R. and Meisel , F. 2012 . Modeling and solving rich quay crane scheduling problems . Computers & Operations Research. , 39 ( 9 ) : 2063 – 2078 .
   Web of Science ®Google Scholar
• Park , Y.M. and Kim , K.H. 2003 . A scheduling method for berth and quay cranes . OR Spectrum. , 25 ( 1 ) : 1 – 23 .
   Web of Science ®Google Scholar
• Meisel , F. and Bierwirth , C. 2009 . Heuristics for the integration of crane productivity in the berth allocation problem . Transportation Research Part E: Logistics and Transportation Review. , 45 ( 1 ) : 196 – 209 .
   Web of Science ®Google Scholar
• Zhang , C. , Zheng , L. , Zhang , Z. , Shi , L. and Armstrong , A.J. 2010 . The allocation of berths and quay cranes by using a sub-gradient optimization technique . Computers and Industrial Engineering. , 58 ( 1 ) : 40 – 50 .
   Web of Science ®Google Scholar
• Raa , B. , Dullaert , W. and Schaeren , R.V. 2011 . An enriched model for the integrated berth allocation and quay crane assignment problem . Expert Systems with Applications. , 38 ( 11 ) : 14136 – 14147 .
   Web of Science ®Google Scholar
• Liang , C. , Huang , Y. and Yang , Y. 2009 . A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning . Computers and Industrial Engineering. , 56 ( 3 ) : 1021 – 1028 .
   Web of Science ®Google Scholar
• Lee , D.-H. and Qiu Wang , H. 2010 . Integrated discrete berth allocation and quay crane scheduling in port container terminals . Engineering Optimization. , 42 ( 8 ) : 747 – 761 .
   Web of Science ®Google Scholar
• D. Karaboga , An Idea Based on Honey Bee Swarm for Numerical Optimization , in: Technical Report TR06 , Computer Engineering Department, Erciyes University , Kayseri , , Turkey , 2005 .
   Google Scholar
• Karaboga , D. and Basturk , B. 2007 . A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm . Journal of Global Optimization. , 39 ( 3 ) : 459 – 471 .
   Web of Science ®Google Scholar
• Karaboga , D. and Basturk , B. 2008 . On the performance of artificial bee colony (ABC) algorithm . Applied Soft Computing. , 8 ( 1 ) : 687 – 697 .
   Web of Science ®Google Scholar
• Karaboga , D. and Akay , B. 2009 . A comparative study of artificial bee colony algorithm . Applied Mathematics and Computation. , 214 ( 1 ) : 108 – 132 .
   Web of Science ®Google Scholar
• Li , J.-Q. , Pan , Q.-K. and Gao , K.-Z. 2011 . Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems . International Journal of Advanced Manufacturing Technology. , 55 ( 9-12 ) : 1159 – 1169 .
   Web of Science ®Google Scholar
• Pan , Q.-K. , Fatih Tasgetiren , M. , Suganthan , P.N. and Chua , T.J. 2011 . A discrete artificial bee colony algorithm for the lot- streaming flow shop scheduling problem . Information Sciences. , 181 ( 12 ) : 2455 – 2468 .
   Web of Science ®Google Scholar
• Szeto , W.Y. , Wu , Y. and Ho , S.C. 2011 . An artificial bee colony algorithm for the capacitated vehicle routing problem . European Journal of Operational Research. , 215 ( 1 ) : 126 – 135 .
   Web of Science ®Google Scholar
• Tasgetiren , M.F. , Pan , Q.-K. , Suganthan , P.N. and Chen , A.H.L. 2011 . A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops . Information Sciences. , 181 ( 16 ) : 3459 – 3475 .
   Web of Science ®Google Scholar
• Niu , Q. , Jiao , B. and Gu , X. 2008 . Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time . Applied Mathematics and Computation. , 205 ( 1 ) : 148 – 158 .
   Web of Science ®Google Scholar
• Kashan , A.H. and Karimi , B. 2009 . A discrete particle swarm optimization algorithm for scheduling parallel machines . Computers and Industrial Engineering. , 56 ( 1 ) : 216 – 223 .
   Web of Science ®Google Scholar
• J. Kennedy and R. Eberhart , Particle swarm optimization . In Proceeding of IEEE International Conference on Neural Networks . Perth , Australia , 1995 , pp. 1942 – 1948 .
   Google Scholar
• Ruiz , R. and Stutzle , T. 2007 . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research. , 177 ( 3 ) : 2033 – 2049 .
   Web of Science ®Google Scholar