Disruption recovery model for berth and quay crane scheduling in container terminals

This article addresses the problem of recovering berth and quay crane (QC) schedules in container terminals when disruptions occur after a subset of operations has been processed. Firstly, models for simultaneous optimization of berth and QC schedules are developed. Then, two strategies, namely, QC rescheduling strategy and berth reallocation strategy are proposed to tackle disruptions and recover the berth and QC schedule, and models for the two strategies are developed respectively. To solve the disruption recovery models, algorithms based on local rescheduling and tabu search are designed. Finally, numerical experiments are provided to illustrate the validity of the proposed model and algorithms.

[1]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[2]  Xiangtong Qi,et al.  Coordination of supply chain after demand disruptions when retailers compete , 2007 .

[3]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[4]  Lixin Miao,et al.  Quay crane scheduling with non-interference constraints in port container terminals , 2008 .

[5]  Reza Tavakkoli-Moghaddam,et al.  An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports , 2009, Comput. Ind. Eng..

[6]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[7]  Anne V. Goodchild,et al.  Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations , 2006, Transp. Sci..

[8]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[9]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[10]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[11]  Xiangtong Qi,et al.  Disruption Management: Framework, Models And Applications , 2004 .

[12]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[13]  Cameron G. Walker,et al.  Simultaneous disruption recovery of a train timetable and crew roster in real time , 2005, Comput. Oper. Res..

[14]  Xiangtong Qi,et al.  Disruption management for machine scheduling: The case of SPT schedules , 2006 .

[15]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .

[16]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .

[17]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003, OR Spectr..

[18]  Qingcheng Zeng,et al.  Integrating simulation and optimization to schedule loading operations in container terminals , 2009, Comput. Oper. Res..

[19]  Carlos F. Daganzo,et al.  THE CRANE SCHEDULING PROBLEM , 1989 .

[20]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[21]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[22]  Anne Goodchild,et al.  Crane double cycling in container ports: Planning methods and evaluation , 2007 .

[23]  D. Petrovic,et al.  A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions , 2006, Fuzzy Sets Syst..