Scheduling cranes at an indented berth

Container terminals are facing great challenges in order to meet the shipping industry’s requirements. An important fact within the industry is the increasing vessel sizes. Actually, within the last decade the ship size in the Asia–Europe trade has effectively doubled. However, port productivity has not doubled along with the larger vessel sizes. This has led to increased vessel turn around times at ports which indeed is a severe problem. In order to meet the industry targets a game-changer in container handling is required. Indented berth structure is one important opportunity to handle this issue. This novel berth structure requires new models and solution techniques for scheduling the quay cranes serving the indented berth. Accordingly, in this paper, we approach the quay crane scheduling problem at an indented berth structure. We focus on the challenges and constraints related to the novel architecture. We model the quay crane scheduling problem under the special structure and develop a solution technique based on branch-and-price. Extensive experiments are conducted to validate the efficiency of the proposed algorithm.

[1]  Iris F. A. Vis,et al.  Performance analysis of berth configurations at container terminals , 2010, OR Spectr..

[2]  Christian Bierwirth,et al.  A follow-up survey of berth allocation and quay crane scheduling problems in container terminals , 2015, Eur. J. Oper. Res..

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

[4]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .

[5]  Michela Milano,et al.  Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces, 27) , 2003 .

[6]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[7]  Der-Horng Lee,et al.  Heuristics for quay crane scheduling at indented berth , 2011 .

[8]  Diego Klabjan,et al.  Multiship Crane Sequencing with Yard Congestion Constraints , 2009, Transp. Sci..

[9]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

[10]  Kees Jan Roodbergen,et al.  Transport operations in container terminals: Literature overview, trends, research directions and classification scheme , 2014, Eur. J. Oper. Res..

[11]  Yan Wang,et al.  A quay crane scheduling algorithm considering the workload of yard cranes in a container yard , 2011, J. Intell. Manuf..

[12]  Ebru K. Bish,et al.  A multiple-crane-constrained scheduling problem in a container terminal , 2003, Eur. J. Oper. Res..

[13]  Yi Zhu,et al.  Crane scheduling with spatial constraints , 2004 .

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

[15]  Rune Møller Jensen,et al.  On the complexity of container stowage planning problems , 2014, Discret. Appl. Math..

[16]  Carlos F. Daganzo,et al.  The Productivity of Multipurpose Seaport Terminals , 1990, Transp. Sci..