Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem

DOI10.1007/s10951-013-0364-7zbMath1305.90188OpenAlexW186322937MaRDI QIDQ490323

Jens Hermans

Publication date: 22 January 2015

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-013-0364-7

zbMATH Keywords

polynomial time algorithmdeterministic schedulinginland shippinglocks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

The lockmaster's problem ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ No-Wait Scheduling for Locks

Cites Work

• Unnamed Item
• Recent advances on two-dimensional bin packing problems
• A note on scheduling equal-length jobs to maximize throughput
• Scheduling equal-length jobs on identical parallel machines
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Complexity results for single-machine problems with positive finish-start time-lags
• Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
• Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem