Easy Cases of Deadlock Detection in Train Scheduling
From MaRDI portal
Publication:5106357
DOI10.1287/opre.2022.2283zbMath1497.90083OpenAlexW4291756463MaRDI QIDQ5106357
Leonardo Lamorgese, Veronica Dal Sasso, Carlo Mannino, Antonio Tancredi, Paolo Ventura
Publication date: 19 September 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2022.2283
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Job-shop scheduling with blocking and no-wait constraints
- Air traffic flow management with layered workload constraints
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem
- Finding disjoint paths with different path-costs: Complexity and algorithms
- Ship Traffic Optimization for the Kiel Canal
- A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management
- Prevention of system deadlocks
- Predicting deadlock in store‐and‐forward networks
- Scheduling
This page was built for publication: Easy Cases of Deadlock Detection in Train Scheduling
