|The generalized lock scheduling problem: an exact approach|Verstichel, J.; De Causmaecker, P.; Spieksma, F.; Vanden Berghe, G. (2014). The generalized lock scheduling problem: an exact approach. Transp. Res., Part E Logist. Trans. Rev. 65: 16-34. dx.doi.org/10.1016/j.tre.2013.12.010
In: Transportation Research. Part E, Logistics and Transportation Review. Pergamon: Exeter. ISSN 1366-5545; e-ISSN 1878-5794
Lock scheduling problem; Integer programming; Packing; Scheduling
|Auteurs|| || Top |
- Verstichel, J.
- De Causmaecker, P.
- Spieksma, F.
- Vanden Berghe, G.
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.