License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2011.27
URN: urn:nbn:de:0030-drops-32647
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3264/
Go to the corresponding OASIcs Volume Portal


Coene, Sofie ; Spieksma, Frits C. R.

The Lockmaster's problem

pdf-format:
Document 1.pdf (416 KB)


Abstract

Inland waterways form a natural network that is an existing, congestion free infrastructure with capacity for more traffic. The European commission promotes the transportation of goods by ship as it is a reliable, efficient and environmental friendly way of transport. A bottleneck for transportation over water are the locks that manage the water level. The lockmaster's problem concerns the optimal strategy for operating such a lock. In the lockmaster's problem we are given a lock, a set of ships coming from downstream that want to go upstream, and another set of ships coming from upstream that want to go downstream. We are given the arrival times of the ships and a constant lockage time; the goal is to minimize total waiting time of the ships. In this paper a dynamic programming algorithm (DP) is proposed that solves the lockmaster's problem in polynomial time. We extend this DP to different generalizations that consider weights, water usage, capacity, and (a fixed number of) multiple chambers. Finally, we prove that the problem becomes strongly NP-hard when the number of chambers is part of the input.

BibTeX - Entry

@InProceedings{coene_et_al:OASIcs:2011:3264,
  author =	{Sofie Coene and Frits C. R. Spieksma},
  title =	{{The Lockmaster's problem}},
  booktitle =	{11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{27--37},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-33-0},
  ISSN =	{2190-6807},
  year =	{2011},
  volume =	{20},
  editor =	{Alberto Caprara and Spyros Kontogiannis},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3264},
  URN =		{urn:nbn:de:0030-drops-32647},
  doi =		{http://dx.doi.org/10.4230/OASIcs.ATMOS.2011.27},
  annote =	{Keywords: lock scheduling, batch scheduling, dynamic programming, complexity}
}

Keywords: lock scheduling, batch scheduling, dynamic programming, complexity
Seminar: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue Date: 2011
Date of publication: 19.09.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI