The lockmaster's problem

DOI10.1016/J.EJOR.2015.12.007zbMath1346.90597OpenAlexW3122013344MaRDI QIDQ322695

Frits C. R. Spieksma, Dirk Briskorn, Ward Passchyn, Johann L. Hurink, Sofie Coene, Greet vanden Berghe

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.12.007

zbMATH Keywords

complexitytransportationdynamic programmingbatch schedulinglock scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)

Related Items (15)

Mathematical programming models for lock scheduling with an emission objective ⋮ The lockmaster's problem ⋮ Scheduling of waterways with tide and passing box ⋮ Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ No-Wait Scheduling for Locks ⋮ Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic ⋮ Vessel velocity decisions in inland waterway transportation under uncertainty ⋮ An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective ⋮ Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective ⋮ Inland waterway efficiency through skipper collaboration and joint speed optimization ⋮ Scheduling parallel batching machines in a sequence ⋮ Scheduling ships movements within a canal harbor ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor

Cites Work

• Unnamed Item
• The lockmaster's problem
• Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
• Parallel batch scheduling of equal-length jobs with release and due dates
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
• Scheduling a batching machine
• Batching identical jobs
• On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
• Scheduling a batch processing machine with bipartite compatibility graphs
• Scheduling with batching: A review
• Exact and heuristic methods for placing ships in locks
• Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock
• Batch processing with interval graph compatibilities between tasks
• The Lockmaster's problem
• Simulation of alternative approaches to relieving congestion at locks in a river transportion system
• An Optimal Scheduling System for the Welland Canal
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Improved Algorithms for Economic Lot Size Problems
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: The lockmaster's problem