The generalized lock scheduling problem: An exact approach

The present paper introduces an integrated approach to solving the generalized lock scheduling problem. Three interrelated sub problems can be discerned: ship placement, chamber assignment and lockage operation scheduling. In their turn, these are closely related to the 2D bin packing problem, the assignment problem and the (parallel) machine scheduling problem respectively. In previous research, the three sub problems mentioned were considered separately, often using (heuristic) interaction between them to obtain better solutions. A mixed integer linear programming model is presented and applied to instances from both inland locks and locks in a tide independent port. The experiments show that small instances incorporating a wide range of real-life constraints can be solved to optimality.

[1]  Frits C. R. Spieksma,et al.  The lockmasters' problem , 2011 .

[2]  Jan Fabian Ehmke,et al.  Scheduling operations at system choke points with sequence-dependent delays and processing times , 2011 .

[3]  Kap Hwan Kim,et al.  Optimizing the Block Size in Container Yards , 2010 .

[4]  Frits C. R. Spieksma,et al.  The lockmaster's problem : a computational study , 2013 .

[5]  Robert M. Nauss,et al.  Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock , 2008, Eur. J. Oper. Res..

[6]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[7]  Greet Van den Berghe,et al.  A Late Acceptance Algorithm for the Lock Scheduling Problem , 2009 .

[8]  L. Douglas Smith,et al.  Investigating Strategic Alternatives for Improving Service in an Inland Waterway Transportation System , 2010, Int. J. Strateg. Decis. Sci..

[9]  Frits C. R. Spieksma,et al.  Exact and heuristic methods for placing ships in locks , 2014, Eur. J. Oper. Res..

[10]  Matthew E. H. Petering.  Decision support for yard capacity, fleet composition, truck substitutability, and scalability issues at seaport container terminals , 2011 .

[11]  Der-Horng Lee,et al.  A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals , 2012 .

[12]  Der-Horng Lee,et al.  Terminal and yard allocation problem for a container transshipment hub with multiple terminals , 2012 .

[13]  Frits C. R. Spieksma,et al.  The Lockmaster's problem , 2011, ATMOS.

[14]  Daofang Chang,et al.  Integrating Berth Allocation and Quay Crane Assignments , 2010 .

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

[16]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[17]  David Pisinger,et al.  The two-dimensional bin packing problem with variable bin sizes and costs , 2005, Discret. Optim..

[18]  Patrick De Causmaecker,et al.  Scheduling algorithms for the lock scheduling problem , 2011 .