No-Wait Scheduling for Locks

DOI10.1287/ijoc.2018.0848zbMath1451.90069OpenAlexW3122778354WikidataQ128028073 ScholiaQ128028073MaRDI QIDQ5139604

Ward Passchyn, Dirk Briskorn, Frits C. R. Spieksma

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/eae3223f-9898-4fa2-b446-0b052c0ffb0d

zbMATH Keywords

algorithmslock schedulinginterval scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

Vessel velocity decisions in inland waterway transportation under uncertainty ⋮ Inland waterway efficiency through skipper collaboration and joint speed optimization

Cites Work

• Unnamed Item
• Mathematical programming models for lock scheduling with an emission objective
• The lockmaster's problem
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
• Interval scheduling on related machines
• Trapezoid graphs and generalizations, geometry and algorithms
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Interval Selection with Machine-Dependent Intervals
• Scheduling Bidirectional Traffic on a Path
• Interval scheduling: A survey
• An Optimal Solution for the Channel-Assignment Problem
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: No-Wait Scheduling for Locks