IMIS

A new integrated search interface will become available in the next phase of marineinfo.org.
For the time being, please use IMIS to search available data

 

[ report an error in this record ]basket (0): add | show Print this page
Scheduling algorithms for the lock scheduling problem
Verstichel, J.; De Causmaecker, P.; Vanden Berghe, G. (2011). Scheduling algorithms for the lock scheduling problem. Procedia. Social and Behavioral Sciences 20: 806-815. https://dx.doi.org/10.1016/j.sbspro.2011.08.089
In: Procedia. Social and Behavioral Sciences. Curran: Red Hook. ISSN 1877-0428, more
Peer reviewed article  
Available in  Authors 
Author keywords
    Lock scheduling; parallel machine scheduling; (meta) heuristics
Authors  Top 
  • Verstichel, J., more
  • De Causmaecker, P., more
  • Vanden Berghe, G., more
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. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of the Organizing Committee.
All data in the Integrated Marine Information System (IMIS) is subject to the VLIZ privacy policy Top | Authors