Title: Scheduling algorithms for the lock scheduling problem
Authors: Verstichel, Jannes ×
De Causmaecker, Patrick
Vanden Berghe, Greet #
Issue Date: Sep-2011
Publisher: ELSEVIER
Host Document: Procedia - Social and Behavioral Sciences vol:20 pages:806-815
Conference: The State of the Art in the European Quantitative Oriented Transportation and Logistics Research - 14th Euro Working Group on Transportation & 26th Mini Euro Conference & 1st European Scientific Conference on Air Transport location:Poznan, Poland date:6-9 September 2011
Abstract: In the present contribution we will show that scheduling a lock having at least two identical chambers requires solving the identical parallel machine scheduling problem with unit processing times, release dates and sequence dependent setup times. The lock scheduling problem considers the order in which a number of ships should be transferred through a lock. A lock may have one or more parallel chambers of a different size, each requiring a certain amount of time to transfer any possible feasible set of ships, called a lockage, through the lock. A mathematical model and meta heuristic are proposed for solving this problem.
ISSN: 1877-0428
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Computer Science Technology TC, Technology Campuses Ghent and Aalst
Technologiecluster Computerwetenschappen
Computer Science, Campus Kulak Kortrijk
Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science