Task scheduling in networks

SIAM Journal on Discrete Mathematics

Volumn 10, Issue 4, 1997, Pages 573-598

  Phillips, Cynthia ^a   Stein, Clifford ^b   Wein, Joel ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b Dartmouth College   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Networks; NP completeness; Scheduling

Indexed keywords

EID: 0001167633     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480194279057     Document Type: Article

References (26)

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 IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 334-343.
2. B. AWERBUCH, S. KUTTEN, AND D. PELEG, Competitive distributed job scheduling, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 571-580.
3. J. BRUNO, E. COFFMAN, AND R. SETHI, Scheduling independent tasks to reduce mean finishing time, Comm. ACM, 17 (1974), pp. 382-387.
4. X. DENG, H. LIU, J. LONG, AND B. XIAO, Competitive analysis of network load balancing, J. Parallel Distrib. Comput., 40 (1997), pp. 162-172.
5. 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, ACM, New York, 1994, pp. 210-219.
6. R. GRAHAM, Bounds for certain multiprocessor anomalies, Bell System Technical Journal, 45 (1966), pp. 1563-1581.
7. R. GRAHAM, Bounds on multiprocessing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 263-269.
8. D. GUSFIELD, Bounds for naive multiple machine scheduling with release times and deadlines, J. Algorithms, 5 (1984), pp. 1-6.
9. L. HALL AND D. B. SHMOYS, Approximation schemes for constrained scheduling problems, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1989, pp. 134-141.
10. D. HOCHBAUM AND D. SHMOYS, Using dual approximation algorithms for scheduling problems: theoretical and practical results, J. ACM, 34 (1987), pp. 144-162.
11. D. HOCHBAUM AND D. SHMOYS, A polynomial approximation scheme for machine scheduling on uniform processors: using the dual approximation approach, SIAM J. Comput., 17 (1988), pp. 539-551.
12. W. HORN, Minimizing average flow time with parallel machines, Oper. Res., 21 (1973), pp. 846-847.
13. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
14. T. KAWAGUCHI AND S. KYAN, Worst case bound of an LRF schedule for the mean weighted flow-time problem, SIAM J. Comput., 15 (1986), pp. 1119-1129.
15. E. LAWLER, J. LENSTRA, A. R. KAN, AND D. SHMOYS, Sequencing and scheduling: Algorithms and complexity, in Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, S. Graves, A. R. Kan, and P. Zipkin, eds., North-Holland, Amsterdam, 1993, pp. 445-522.
16. J. LENSTRA, A. R. KAN, AND P. BRUCKER, Complexity of machine scheduling problems, Ann. Discrete Math., 1 (1977), pp. 343-362.
17. J. LENSTRA, D. SHMOYS, AND E. TARDOS, Approximation algorithms for scheduling unrelated parallel machines, Math. Programming, 46 (1990), pp. 259-271.
18. J. H. LODGE, Mobile satellite communication systems: Toward global personal communications, IEEE Communications Magazine, 30 (1991), pp. 24-31.
19. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Towards an architecture-independent analysis of parallel algorithms, SIAM J. Comput., 19 (1990), pp. 322-328.
20. D. PELEG, private communication, 1992.
21. S. PLOTKIN, D. B. SHMOYS, AND E. TARDOS, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 20 (1995), pp. 257-301.
22. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
23. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
24. D. B. SHMOYS, C. STEIN, AND J. WEIN, Improved approximation algorithms for shop scheduling problems, SIAM J. Comput., 23 (1994), pp. 617-632.
25. D. B. SHMOYS AND E. TARDOS, An approximation algorithm for the generalized assignment problem, Math. Programming A, 62 (1993), pp. 461-474.
26. P. WOOD, Mobile satellite services for travelers, IEEE Communications Magazine, 30 (1991), pp. 32-35.