Scheduling problems in transportation networks of line topology

In this paper we consider online scheduling problems for linear topology under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times. We give optimal solutions for uni-directional version of the problem for each of the objectives and show that for the two-directional versions of each problem, no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions. We also propose 2-approximation on-line algorithms for the MinMakespan and the MinSum minimization objectives. We also prove that no online algorithm can deterministically achieve the optimal solution for any of the considered objective functions for the weighted case of uni-directional scenarios.

[1]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.

[2]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[3]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[4]  Rajmohan Rajaraman,et al.  Time-Constrained Scheduling of Weighted Packets on Trees and Meshes , 2003, Algorithmica.

[5]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[6]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[7]  Marios Mavronicolas,et al.  Near-Optimal Hot-Potato Routing on Trees , 2004, Euro-Par.

[8]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[9]  B. Mohar,et al.  Graph Minors , 2009 .

[10]  Joseph Y.-T. Leung,et al.  On-Line Routing of Real-Time Messages , 1996, J. Parallel Distributed Comput..

[11]  Rudolf Fleischer,et al.  Efficient Algorithms for k -Disjoint Paths Problems on DAGs , 2007, AAIM.

[12]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[13]  Shay Kutten,et al.  Greedy Packet Scheduling , 1990, WDAG.

[14]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[15]  Biing-Feng Wang,et al.  Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph , 2010, J. Comput. Syst. Sci..

[16]  Arnold L. Rosenberg,et al.  Scheduling Time-Constrained Communication in Linear Networks , 1998, SPAA.

[17]  Luisa Gargano.  Time Optimal Gathering in Sensor Networks , 2007, SIROCCO.

[18]  Michael Segal,et al.  Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies , 2009, Int. J. Distributed Sens. Networks.

[19]  Leen Stougie,et al.  Data Gathering in Wireless Networks , 2010, Graphs and Algorithms in Communication Networks.

[20]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[21]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[22]  Martin Skutella,et al.  Packet Routing on the Grid , 2010, LATIN.

[23]  Hervé Rivano,et al.  Minimum Delay Data Gathering in Radio Networks , 2009, ADHOC-NOW.

[24]  Shmuel Zaks,et al.  Scheduling in Synchronous Networks and the Greedy Algorithm , 1999, Theor. Comput. Sci..