Scheduling problems in transportation networks of line topology

DOI10.1007/s11590-013-0613-xzbMath1292.90118MaRDI QIDQ2448158

Michael Segal, Dariusz R. Kowalski, Vitaly Milyeykovsky, Eyal Nussbaum

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0613-x

zbMATH Keywords

scheduling; online algorithms; linear network

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B10: Deterministic network models in operations research

Related Items

Scheduling Problems over Network of Machines, Approximation Algorithms for Generalized Path Scheduling, Scheduling problems over a network of machines

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of finding two disjoint paths with min-max objective function
• An approximation algorithm for the wireless gathering problem
• Scheduling in synchronous networks and the greedy algorithm
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Time-constrained scheduling of weighted packets on trees and meshes
• Scheduling time-constrained communication in linear networks
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Data Gathering in Wireless Networks
• Packet Routing on the Grid
• Greedy Packet Scheduling
• Greedy Packet Scheduling on Shortest Paths
• Euro-Par 2004 Parallel Processing