The expected competitive ratio for weighted completion time scheduling

Theory of Computing Systems

Volumn 39, Issue 1, 2006, Pages 121-136

  Souza, Alexander ^a   Steger, Angelika ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS OF DISTRIBUTIONS; DISTRIBUTED PROCESSING; EXPONENTIAL DISTRIBUTIONS; IDENTICAL PARALLEL MACHINES; LIST SCHEDULING ALGORITHMS; NON-PREEMPTIVE MANNERS; TOTAL WEIGHTED COMPLETION TIME; WEIGHTED COMPLETION TIME;

BUSINESS MACHINES;

SCHEDULING;

EID: 30744461838     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-005-1261-z     Document Type: Conference Paper

References (30)

1. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, 1998.
2. E. C. Bruno, Jr., and R. Sethi. Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17:382-387, 1974.
3. J. Bruno, P. Downey, and G. N. Frederickson. Sequencing tasks with exponential service times to minimize the expected flow time or makespan. Journal of the ACM, 28(1): 100-113, 1981.
4. E. G. Coffman, Jr., and E. N. Gilbert. On the expected relative performance of list scheduling. Operations Research, 33(3):548-561, 1985.
5. R. W. Conway, W. L. Maxwell, and L. W. Miller. Theory of Scheduling. Addison-Wesley, Reading, MA, 1967.
6. W. L. Eastman, S. Even, and I. M. Isaacs. Bounds for the optimal scheduling of n jobs on m processors. Management Science, 11:268-279, 1964.
7. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
8. I. Gertsbakh. Statistical Reliability Theory. Marcel Dekker, New York, 1989.
9. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
10. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Mathematics of Operations Research, 22:513-544, 1997.
11. T. Kämpke. On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability, 24:430-448, 1987.
12. T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4):1119-1129, 1986.
13. E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94), pages 394-400, 1994.
14. B. J. Lageweg and J. K. Lenstra. Unpublished manuscript, 1977.
15. R. H. Möhring, A. S. Schulz, and M. Uetz. Approximation in stochastic scheduling: the power of LP-based priority rules. Journal of the ACM, 46:924-942, 1999.
16. C. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS '95), pages 86-97. Volume 955 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
17. C. A. Phillips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming, 82:199-223, 1998.
18. M. Pinedo. Scheduling-Theory, Algorithms, and Systems. Prentice-Hall, Englewood Cliffs, NJ, 1995.
19. M. Pinedo and R. Weber. Inequalities and bounds in stochastic shop scheduling. SIAM Journal on Applied Mathematics, 44(4):867-879, 1984.
20. C. M. Potts. An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming Study, 13:78-87, 1980.
21. M. H. Rothkopf. Scheduling with random service times. Management Science, 12:707-713, 1966.
22. S. K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23:116-127, 1976.
23. M. Scharbrodt, T. Schickinger, and A. Steger. A new average case analysis for completion time scheduling. Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02), pages 170-178, 2002.
24. Journal version accepted for publication by Journal of the ACM.
25. A. S. Schulz. Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. Proceedings of the International Conference, on Integer Programming and Combinatorial Optimization, pages 301-315. Volume 1084 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
26. M. Skutella. Semidefinite relaxations for parallel machine scheduling. Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS '98), pages 472-481, 1998.
27. M. Skutella and G. J. Woeginger. A PTAS for minimizing the total weighted completion time on identical parallel machines. Mathematics of Operations Research, 25:63-75, 2000.
28. W. E. Smith. Various optimizers for single stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
29. R. R. Weber, P. Varaiya, and J. Walrand. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. Journal of Applied Probability, 23:841-847, 1986.
30. G. Weiss and M. Pinedo. Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. Journal of Applied Probability, 17:187-202, 1980.