Task scheduling in networks

Extended abstract
  • Cynthia Phillips
  • Clifford Stein
  • Joel Wein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 824)


Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper, we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms and hardness proofs for many of the fundamental problems in network scheduling. We consider two basic scheduling objectives: minimizing the makespan, and minimizing the average completion time. For the makespan we prove small constant factor hardness-to-approximate and approximation results for the most general forms of the problem. For the average completion time, we give a log-squared approximation algorithm; the techniques used in this approximation are somewhat general and have other applications. For example, we give the first non-trivial approximation algorithm to minimize the average completion time of a set of jobs with release dates on identical parallel machines.

Another contribution of this paper is to introduce an interesting class of questions about the design of networks to support specific computational tasks, and to give a polylogarithmic approximation algorithm for one of those problems; specifically, we give approximation algorithms to determine the minimum cost set of machines with which to augment a network so as to make possible a schedule of a certain target length.


Schedule Problem Approximation Algorithm Parallel Machine Schedule Length Identical Parallel Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Alon, G. Kalai, M. Ricklin, and L. Stockmeyer. Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 334–343, 1992.Google Scholar
  2. 2.
    B. Awerbuch, S. Kutten, and D.Peleg. Competetive distributed job scheduling. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 571–580, 1992.Google Scholar
  3. 3.
    J.L. Bruno, E.G. Coffman, and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382–387, 1974.CrossRefGoogle Scholar
  4. 4.
    V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233–235, August 1979.Google Scholar
  5. 5.
    X. Deng, H. Liu, J. Long, and B. Xiao. Deterministic load balancing in computer networks. In Proceedings of 2nd IEEE Symposium on Parallel and Distributed Processing, 1992.Google Scholar
  6. 6.
    P. Fizzano, D. Karger, C. Stein, and J. Wein. Job scheduling in rings. In Proceedings of the 1994 ACM Symposium on Parallel Algorithms and Architectures, 1994.Google Scholar
  7. 7.
    R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563–1581, 1966.Google Scholar
  8. 8.
    R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17:263–269, 1969.Google Scholar
  9. 9.
    M. Grotschel, C. L. Monma, and M. Stoer. Design of survivable networks. In Handbook in Operations Research and Management Science. 1992. To appear.Google Scholar
  10. 10.
    D. Gusfield. Bounds for naive multiple machine scheduling with release times and deadlines. Journal of Algorithms, 5:1–6, 1984.Google Scholar
  11. 11.
    L. Hall and D. B. Shmoys. Approximation schemes for constrained scheduling problems. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 134–141. IEEE, October 1989.Google Scholar
  12. 12.
    D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34:144–162, 1987.Google Scholar
  13. 13.
    D.S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17:539–551, 1988.Google Scholar
  14. 14.
    W. Horn. Minimizing average flow time with parallel machines. Operations Research, 21:846–847, 1973.Google Scholar
  15. 15.
    E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operations Research and Management Science, Vol 4., Logistics of Production and Inventory, pages 445–522. North-Holland, 1993.Google Scholar
  16. 16.
    D. N. Lee, K. T. Medhi, J. L. Strand, R. G. Cox, and S. Chen. Solving large telecommunications network loading problems. AT&T Technical Journal, 68(3):48–56, 1989.Google Scholar
  17. 17.
    J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362, 1977.Google Scholar
  18. 18.
    J.K. Lenstra, D.B. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259–271, 1990.Google Scholar
  19. 19.
    D. Peleg, 1992. Private communication.Google Scholar
  20. 20.
    S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991. To appear.Google Scholar
  21. 21.
    P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130–143, 1988.Google Scholar
  22. 22.
    P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365–374, 1987.Google Scholar
  23. 23.
    D. B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pages 148–157, January 1991. To appear in Siam J. Computing.Google Scholar
  24. 24.
    D. B. Shmoys and E. Tardos. Scheduling parallel machines with costs. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 448–455, January 1993.Google Scholar
  25. 25.
    D. B. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 1994. To appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Cynthia Phillips
    • 1
  • Clifford Stein
    • 2
  • Joel Wein
    • 3
  1. 1.Sandia National LabsAlbuquerqueUSA
  2. 2.Department of Computer ScienceDartmouth CollegeHanoverUSA
  3. 3.Department of Computer SciencePolytechnic UniversityBrooklynUSA

Personalised recommendations