Scheduling Bidirectional Traffic on a Path
From MaRDI portal
Publication:3448803
DOI10.1007/978-3-662-47672-7_33zbMath1440.90008arXiv1504.07129OpenAlexW2249768568MaRDI QIDQ3448803
Yann Disser, Max Klimm, Elisabeth Lübbecke
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07129
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Scheduling Bidirectional Traffic on a Path ⋮ Scheduling of waterways with tide and passing box ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ No-Wait Scheduling for Locks ⋮ Complexity, bounds and dynamic programming algorithms for single track train scheduling ⋮ Minimizing the maximal weighted lateness of delivering orders between two railroad stations ⋮ Two-directional traffic scheduling problem solution for a single-track railway with siding ⋮ Scheduling parallel batching machines in a sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Railway track allocation: Models and methods
- A simplified NP-complete satisfiability problem
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Complexity results for flow-shop problems with a single server
- Scheduling with batching: A review
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times
- Scheduling Bidirectional Traffic on a Path
- The Complexity of Flowshop and Jobshop Scheduling
- Reducibility among Combinatorial Problems
- Ship Traffic Optimization for the Kiel Canal
- Algorithms and Computation
- Packet Forwarding Algorithms in a Line Network
This page was built for publication: Scheduling Bidirectional Traffic on a Path
