Easy cases of deadlock detection in train scheduling

DOI10.1287/OPRE.2022.2283MaRDI QIDQ5106357zbMATH OpenOpenAlexFDO

Authors Veronica Dal Sasso, Leonardo Lamorgese, Carlo Mannino, Antonio Tancredi, P. 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

zbMATH Keywords

deadlocksrailwaystrain scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 947017
• Publication:4727428
• Deadlock resolution in wait-for graphs by vertex/arc deletion
• scientific article; zbMATH DE number 3938552
• Deletion graph problems based on deadlock resolution

Cites work

• A noncompact formulation for job-shop scheduling problems in traffic management
• 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
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Job-shop scheduling with blocking and no-wait constraints
• Network flows. Theory, algorithms, and applications.
• Predicting deadlock in store‐and‐forward networks
• Prevention of system deadlocks
• Scheduling. Theory, algorithms, and systems.
• Ship traffic optimization for the Kiel Canal

Cited in

(1)

• Avoiding deadlocks via weak deadlock sets

This page was built for publication: Easy cases of deadlock detection in train scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106357)