Mark Scharbrodt
ABSTRACT
(MATH) We present a new average case analysis for the problem of scheduling n jobs on $m$ machines so that the sum of job completion times is minimized. Our analysis transfers the concept of competitive analysis --- which is a typical worst case notion --- to the average case. We show that the classic SEPT scheduling strategy with Ω(n) worst case competitive ratio achieves ${\cal O}(1)$ on the average. Moreover, bounds on the probability distribution of the competitive ratio are derived which provide an in-depth understanding of the stochastic version of the min sum scheduling problem.
- M. Abramowitz and I. A. Stegun, editors. Handbook of (MATH)ematical Functions. Dover Publications, New York, 1970. Google Scholar
Digital Library
- E. G. Coffmann, Jr. and E. N. Gilbert. Expected relative performance of list scheduling rules. Oper. Res., 33:548--561, 1985.Google ScholarDigital Library
- E. G. Coffmann, Jr., K. Sao, M. Hofri, and A. C. Yao. A stochastic model of bin--packing. Inf. and Cont., 44:105--115, 1980.Google ScholarCross Ref
- W. Feller. An Introduction to Probability Theory and its Applications, volume I. John Wiley & Sons, New York, 1957.Google Scholar
- K. D. Glazebrook. Scheduling tasks with exponential service times on parallel machines. Journal of Applied Probability, 16:685--689, 1979.Google ScholarCross Ref
- R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy~Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete (MATH)ematics, 5:287--326, 1979.Google Scholar
- T. Kämpe. On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability, 24:430--448, 1987.Google ScholarCross Ref
- N. Karmakar. Probabilistic analysis of some bin--packing algorithms. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 107--111, 1982.Google Scholar
- Z. Liu and E. Sanlaville. Stochastic scheduling with variable profile and precedence constraints. Technical Report RR-1525, Inria, Institut National de Recherche en Informatique et en Automatique, 1997.Google ScholarDigital Library
- R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6:1--12, 1959.Google ScholarDigital Library
- R. H. Möhring and F. J. Radermacher. Introduction to stochastic scheduling problems. In Contributions to operations research, volume 240 of Lect. Notes Econ. (MATH). Syst., pages 72--130, Oberwolfach/Ger., 1985.Google Scholar
- R. H. Möhring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems I: General strategies. Z. Oper. Res., Ser. A. 28:193--260, 1984.Google Scholar
- R. H. Möhring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems II: General strategies. Z. Oper. Res., Ser. A. 29:65--104, 1984.Google Scholar
- R. H. Möhring, A. Schulz, and M. Uetz. Approximation in stochastic scheduling: The power of LP--based priority policies. Journal of the ACM, 46:924--942, 1999. Google ScholarDigital Library
- C. H. Papadimitriou and J. N. Tsitsiklis. On stochastic scheduling with in--tree precendence constraints. SIAM Journal on Computing, 16:1--6, 1987. Google ScholarDigital Library
- M. H. Rothkopf. Scheduling with random service times. Management Science, 12:703--713, 1966.Google ScholarDigital Library
- W. E. Smith. Various optimizers for single--stage production. Naval Research and Logistics Quaterly, 3:59--66, 1956.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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.Google ScholarCross Ref
Index Terms
- A new average case analysis for completion time scheduling
Recommendations
A new average case analysis for completion time scheduling
We present a new average case analysis for the problem of scheduling n jobs on m machines so that the sum of job completion times is minimized. Our goal is to use the concept of competitive ratio---which is a typical worst case notion---also within an ...
Efficient algorithms for average completion time scheduling
IPCO'10: Proceedings of the 14th international conference on Integer Programming and Combinatorial OptimizationWe analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average ...
Approximation Techniques for Average Completion Time Scheduling
We consider the problem of nonpreemptive scheduling to minimize average (weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem based ...
Comments