The generalized lock scheduling problem: An exact approach

J. Verstichel, P. De Causmaecker, F.C.R. Spieksma, G. Vanden Berghe

Research output: Contribution to journalArticleAcademicpeer-review

35 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)16-34
JournalTransportation Research. Part E: Logistics and Transportation Review
Volume65
DOIs
Publication statusPublished - May 2014
Externally publishedYes

Keywords

  • Lock scheduling problem
  • Integer programming
  • Packing
  • Scheduling

Cite this