Train Scheduling on a Unidirectional Path

DOI10.4230/LIPIcs.FSTTCS.2017.29zbMath1491.68086OpenAlexW2791717487MaRDI QIDQ5136321

Apoorv Garg, Abhiram G. Ranade

Publication date: 25 November 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.29

zbMATH Keywords

combinatorial optimizationapproximation algorithmcomplexity analysistrain schedulingmax-delay minimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Scheduling trains with small stretch on a unidirectional line

Cites Work

• Unnamed Item
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Job-shop scheduling with blocking and no-wait constraints
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• A framework for dynamic dispatch decision-making applied in transportation scheduling
• Vertex Disjoint Paths for Dispatching in Railways.
• Optimal Real-Time Traffic Control in Metro Stations
• Packet Routing: Complexity and Algorithms
• Knowledge-based system for railway scheduling
• Randomized Routing and Sorting on Fixed-Connection Networks
• OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS

This page was built for publication: Train Scheduling on a Unidirectional Path