SchedulingLPs bear probabilities randomized approximations for minsum criteria
 Andreas S. Schulz,
 Martin Skutella
 … show all 2 hide
Abstract
In this paper, we provide a new class of randomized approximation algorithms for scheduling problems by directly interpreting solutions to socalled timeindexed LPs as probabilities. The most general model we consider is scheduling unrelated parallel machines with release dates (or even network scheduling) so as to minimize the average weighted completion time. The crucial idea for these multiple machine problems is not to use standard list scheduling but rather to assign jobs randomly to machines (with probabilities taken from an optimal LP solution) and to perform list scheduling on each of them.
For the general model, we give a (2+ E)approximation algorithm. The best previously known approximation algorithm has a performance guarantee of 16/3 [HSW96]. Moreover, our algorithm also improves upon the best previously known approximation algorithms for the special case of identical parallel machine scheduling (performance guarantee (2.89 + E) in general [CPS+96] and 2.85 for the average completion time [CMNS97], respectively). A perhaps surprising implication for identical parallel machines is that jobs are randomly assigned to machines, in which each machine is equally likely. In addition, in this case the algorithm has running time O(nlogn) and performance guarantee 2. The same algorithm also is a 2approximation for the corresponding preemptive scheduling problem on identical parallel machines.
Finally, the results for identical parallel machine scheduling apply to both the offline and the online settings with no difference in performance guarantees. In the online setting, we are scheduling jobs that continually arrive to be processed and, for each time t, we must construct the schedule until time t without any knowledge of the jobs that will arrive afterwards.
 B. Awerbuch, S. Kutten, and D. Peleg. Competitive distributed job scheduling. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, pages 571–581, 1992.
 Bruno, J. L., Coffman, E. G., Sethi, R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the Association for Computing Machinery 17: pp. 382387
 C. S. Chekuri, R. Johnson, R. Motwani, B. K. Natarajan, B. R. Rau, and M. Schlansker. Profiledriven instruction level parallel scheduling with applications to super blocks. December 1996. Proceedings of the 29th Annual International Symposium on Microarchitecture (MICRO29), Paris, France.
 S. Chakrabarti and S. Muthukrishnan. Resource scheduling for parallel database and scientific applications. June 1996. Proceedings of the 8th ACM Symposium on Parallel Algorithms and Architectures.
 C. S. Chekurï, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms, pages 609–618, 1997.
 Chakrabarti, S., Phillips, C. A., Schulz, A. S., Shmoys, D. B., Stein, C., Wein, J. Improved scheduling algorithms for minsum criteria. In: Meyer auf der Heide, F., Monien, B. eds. (1996) Automata, Languages and Programming. Springer, Berlin, pp. 646657
 F A. Chudak and D. B. Shmoys. Approximation algorithms for precedenceconstrained scheduling problems on parallel machines that run at different speeds. In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms, pages 581–590,1997.
 X. Deng, H. Liu, J. Long, and B. Xiao. Deterministic load balancing in computer networks. In Proceedings of the 2nd Annual IEEE Symposium on Parallel and Distributed Processing, pages 50–57, 1990.
 Dyer, M. E., Wolsey, L. A. (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 26: pp. 255270
 Erdas, P., Selfridge, J. L. (1973) On a combinatorial game. Journal of Combinatorial Theory A 14: pp. 298301
 Graham, R. L., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5: pp. 287326
 Goemans, M. X. A supermodular relaxation for scheduling with release dates. In: Cunningham, W. H., McCormick, S. T., Queyranne, M. eds. (1996) Integer Programming and Combinatorial Optimization. Springer, Berlin, pp. 288300
 M. X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th ACMSIAM Symposium on Discrete Algorithms, pages 591–598, 1997.
 M. X. Goemans, M. Queyranne, A. S. Schulz, M. Skutella, and Y Wang, 1997. In preparation.
 Hall, L. A., Schulz, A. S., Shmoys, D. B., Wein, J. (1996) Scheduling to minimize average completion time: Offline and online approximation algorithms. Technical University of Berlin, Berlin, Germany
 L. A. Hall, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Offline and online algorithms. In Proceedings of the 7th ACMSIAM Symposium on Discrete Algorithms, pages 142–151, 1996.
 Kawaguchi, T., Kyan, S. (1986) Worst case bound of an LRF schedule for the mean weighted flowtime problem. SIAM Journal on Computing 15: pp. 11191129
 Lenstra, J. K., Rinnooy Kan, A. H. G., Brucker, P. (1977) Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: pp. 343362
 R. Motwani, J. Naor, and P Raghavan. Randomized approximation algorithms in combinatorial optimization. In D. S. Hochbaum, editor, Approximation Algorithms for NPHard Problems, chapter 11. Thomson, 1996.
 R. Motwani and P Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
 Möhring, R. H., Schäffter, M. W., Schulz, A. S. Scheduling jobs with communication delays: Using infeasible solutions for approximation. In: Diaz, J., Serna, M. eds. (1996) AlgorithmsESA'96, volume 1136. Springer, Berlin, pp. 7690
 Phillips, C., Stein, C., Wein, J. (1994) Task scheduling in networks. Algorithm TheorySWAT'94, number 824. Springer, Berlin, pp. 290301
 Phillips, C., Stein, C., Wein, J. (1995) Scheduling jobs that arrive over time. Proceedings of the Fourth Workshop on Algorithms and Data Structures, number 955. Springer, Berlin, pp. 8697
 Raghavan, P., Thompson, C. D. (1987) Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7: pp. 365374
 Schulz, A. S. Scheduling to minimize total weighted completion time: Performance guarantees of LPbased heuristics and lower bounds. In: Cunningham, W. H., McCormick, S. T., Queyranne, M. eds. (1996) Integer Programming and Combinatorial Optimization, number 1084. Springer, Berlin, pp. 301315
 J. Spencer. Ten Lectures on the Probabilistic Method. Number 52 in CBMSNSF Reg. Conf. Ser. Appl. Math. SIAM, 1987.
 Schulz, A. S., Skutella, M. (1997) Randombased scheduling: New approximations and LP lower bounds. Technical University of Berlin, Berlin, Germany
 Shmoys, D. B., Tardos, É. (1993) An approximation algorithm for the generalized assignment problem. Mathematical Programming 62: pp. 461474
 Title
 SchedulingLPs bear probabilities randomized approximations for minsum criteria
 Book Title
 Algorithms — ESA '97
 Book Subtitle
 5th Annual European Symposium Graz, Austria, September 15–17, 1997 Proceedings
 Pages
 pp 416429
 Copyright
 1997
 DOI
 10.1007/3540633979_32
 Print ISBN
 9783540633976
 Online ISBN
 9783540695363
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1284
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Andreas S. Schulz ^{(1)}
 Martin Skutella ^{(1)}
 Author Affiliations

 1. Fachbereich Mathematik, Technische Universität Berlin, MA 61, Straße des 17. Juni 136, 10623, Berlin, Germany
Continue reading...
To view the rest of this content please follow the download PDF link above.