Scheduling trains with small stretch on a unidirectional line

DOI10.1007/978-3-030-67899-9_2OpenAlexW3126689594MaRDI QIDQ831686

Abhiram G. Ranade, Apoorv Garg

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_2

zbMATH Keywords

combinatorial optimizationNP-hardapproximation algorithmspacket schedulingtrain schedulingin-comb networkmax-stretch minimizationunidirectional line

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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
• Vertex Disjoint Paths for Dispatching in Railways.
• Optimal Real-Time Traffic Control in Metro Stations
• Packet Routing: Complexity and Algorithms
• Efficient Schemes for Parallel Communication
• Knowledge-based system for railway scheduling
• OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS
• Train Scheduling on a Unidirectional Path
• A Genetic Algorithm for Railway Scheduling Problems

This page was built for publication: Scheduling trains with small stretch on a unidirectional line