Stochastic online scheduling on parallel machines

Lecture Notes in Computer Science

Volumn 3351, Issue , 2005, Pages 167-180

  Megow, Nicole ^a   Uetz, Marc ^b   Vredeveld, Tjark ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ONLINE SYSTEMS; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

DISTRIBUTED PROCESSING; PARALLEL MACHINES; STOCHASTIC ONLINE SCHEDULING; TIME DISTRIBUTIONS;

STOCHASTIC CONTROL SYSTEMS;

EID: 23944496700     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11389811_15     Document Type: Conference Paper

References (20)

1. J. L. Bruno, P. J. Downey, and G. N. Frederickson. Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. J. ACM, 28:100-113, 1981.
2. S. Chakrabarti and S. Muthukrishnan. Resource scheduling for parallel database and scientific applications. In Proc. 8th Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 329-335, Padua, Italy, 1996.
3. C. Chekuri, R. Johnson, R. Motwani, B. Natarajan, B. Rau, and M. Schlansker. An analysis of profile-driven instruction level parallel scheduling with application to super blocks. In Proc. 29th IEEE/ACM Int. Symp. on Microarchitecture, Paris, France, pages 58-69, 1996.
4. M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnooy Kan, editors. Deterministic and Stochastic Scheduling. D. Reidel Publishing Company, Dordrecht, 1982.
5. W. Eastman, S. Even, and I. Isaacs. Bounds for the optimal scheduling of n jobs on m processors. Mgmt. Sci., 11:268-279, 1964.
6. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discr. Math., 5:287-326, 1979.
7. W. J. Hall and J. A. Wellner. Mean residual life. In M. Csörgö, D. A. Dawson, J. N. K. Rao, and A. K. Md. E. Saleh, editors, Proc. Int. Symp. on Statistics and Related Topics, pages 169-184, Ottawa, ON, 1981. Amsterdam: North-Holland.
8. E. Koutsoupias and C. H. Papadimitriou. Beyond competitive analysis. SIAM J. Comp., 30:300-317, 2000.
9. N. Megow and A. S. Schulz. On-line scheduling to minimize average completion time revisited. Oper. Res. Lett., 32(5):485-490, 2004.
10. R. H. Möhring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems I: General strategies. ZOR - Zeitschrift für Oper. Res., 28:193-260, 1984.
11. R. H. Möhring, A. S. Schulz, and M. Uetz. Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM, 46:924-942, 1999.
12. M.H. Rothkopf. Scheduling with random service times. Mgmt. Sci., 12:703-713, 1966.
13. M. Scharbrodt, T. Schickinger, and A. Steger. A new average case analysis for completion time scheduling. In Proc. 34th Ann. ACM Symp. on the Theory of Computing, Montréal, QB, pages 170-178, 2002.
14. M. Skutella and M. Uetz. Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. In Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, pages 589-590, Washington, DC, 2001.
15. W. Smith. Various optimizers for single-stage production. Naval Res. Log., 3:59-66, 1956.
16. A. Souza-Offermatt and A. Steger. The expected competitive ratio for weighted completion time scheduling. In Proc. 21st Symp. on Theoretical Aspects of Computer Science, Montpellier, France, 2004. To appear.
17. M. Uetz. Algorithms for Deterministic and Stochastic Scheduling. PhD thesis, Cuvillier Verlag, Göttingen, Germany, 2002.
18. G. Weiss. Approximation results in parallel machines stochastic scheduling. Ann. Oper. Res., 26:195-242, 1990.
19. G. Weiss. Turnpike optimality of Smith's rule in parallel machines stochastic scheduling. Math. Oper. Res., 17:255-270, 1992.
20. Gideon Weiss and Michael Pinedo. Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob., 17:187-202, 1980.