Scheduling multiple yard cranes in two adjacent container blocks with position-dependent processing times

Abstract This paper studies the management of three yard cranes in two adjacent container blocks in line, where cranes can move from one block to the other. Comparing with existing literature, the new multi-yard-crane scheduling problem incorporates different constraints together: (i) three yard cranes are deployed simultaneously in two adjacent blocks, (ii) non-crossing and inter-crane interference constraints of yard cranes are considered, (iii) the processing time of each container depends on its real-time location, i.e., position-dependent processing times. For the problem, a 0–1 mixed integer programming (MIP) model is constructed to minimize the total flow time to reduce the total container storage time in container yards, which helps to save container yard resources and increase production efficiency. The proposed model can be solved optimally by CPLEX for small-size instances. As the concerned problem is NP-hard, a fast heuristic and an improved genetic algorithm are devised to produce near-optimal solutions for large-size instances. Numerical experiments validate the developed MIP model and demonstrate the efficiency of the proposed algorithms.

[1]  Der-Horng Lee,et al.  Storage Yard Management in Maritime Container Terminals , 2016, Transp. Sci..

[2]  Feng Chu,et al.  A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations , 2015 .

[3]  W. C. Ng,et al.  Crane scheduling in container yards with inter-crane interference , 2005, Eur. J. Oper. Res..

[4]  Feifeng Zheng,et al.  Integrated berth allocation and quay crane assignment with maintenance activities , 2019 .

[5]  Mark Goh,et al.  Discrete time model and algorithms for container yard crane scheduling , 2009, Eur. J. Oper. Res..

[6]  Kees Jan Roodbergen,et al.  Storage yard operations in container terminals: Literature overview, trends, and research directions , 2014, Eur. J. Oper. Res..

[7]  Iris F. A. Vis,et al.  Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal , 2010, Transp. Sci..

[8]  Chou-Jung Hsu,et al.  Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time , 2012, Optimization Letters.

[9]  K. L. Mak,et al.  An effective heuristic for scheduling a yard crane to handle jobs with different ready times , 2005 .

[10]  Loo Hay Lee,et al.  An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs , 2011, Transp. Sci..

[11]  Chung Yee Lee,et al.  Bi-objective optimization for the container terminal integrated planning , 2016 .

[12]  Feng Chu,et al.  Two Yard Crane Scheduling With Dynamic Processing Time and Interference , 2018, IEEE Transactions on Intelligent Transportation Systems.

[13]  Mark Goh,et al.  Scheduling Multiple Yard Cranes with Crane Interference and Safety Distance Requirement , 2015, Transp. Sci..

[14]  Gang Chen,et al.  Terminal appointment system design by non-stationary M(t)/Ek/c(t) queueing model and genetic algorithm , 2013 .

[15]  Lu Zhen,et al.  Multi-period yard template planning in container terminals , 2016 .

[16]  Christian Prins,et al.  A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem , 2012, Eng. Appl. Artif. Intell..

[17]  Izabela Ewa Nielsen,et al.  A simulation-based genetic algorithm approach for reducing emissions from import container pick-up operation at container terminal , 2016, Ann. Oper. Res..

[18]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[19]  Der-Horng Lee,et al.  The Integrated Yard Truck and Yard Crane Scheduling Problem: Benders' Decomposition-Based Methods , 2010 .

[20]  Alexandre Dolgui,et al.  Single machine scheduling with precedence constraints and positionally dependent processing times , 2012, Comput. Oper. Res..

[21]  Marie-Ange Manier,et al.  A genetic algorithm approach for a single hoist scheduling problem with time windows constraints , 2013, Eng. Appl. Artif. Intell..

[22]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .

[23]  Kap Hwan Kim,et al.  Conservative allocation models for outbound containers in container terminals , 2014, Eur. J. Oper. Res..

[24]  Lu Zhen,et al.  Storage allocation in transshipment hubs under uncertainties , 2014 .

[25]  Dehua Xu,et al.  Makespan minimization for two parallel machines scheduling with a periodic availability constraint: Mathematical programming model, average-case analysis, and anomalies , 2013 .

[26]  Feng Chu,et al.  Single-machine group scheduling with resource allocation and learning effect , 2011, Comput. Ind. Eng..

[27]  Feifeng Zheng,et al.  Scheduling small number of quay cranes with non-interference constraint , 2015, Optim. Lett..

[28]  Gilbert Laporte,et al.  Scheduling Twin Yard Cranes in a Container Block , 2015, Transp. Sci..

[29]  T. C. Edwin Cheng,et al.  Single-machine scheduling with time-dependent and position-dependent deteriorating jobs , 2015, Int. J. Comput. Integr. Manuf..

[30]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[31]  Ya Li,et al.  Yard Crane Dispatching to Minimize Total Weighted Vessel Turnaround Times in Container Terminals , 2015, ICCL.

[32]  T.C.E. Cheng,et al.  Parallel-machine scheduling of deteriorating jobs with potential machine disruptions ☆ , 2017 .