Abstract
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic model where jobs with their processing time distributions are known beforehand, we assume that jobs appear one by one, and every job must be assigned to a machine online. We propose a simple online scheduling policy for that model, and prove a performance guarantee that matches the currently best known performance guarantee for stochastic parallel machine scheduling. For the more general model with job release dates we derive an analogous result, and for NBUE distributed processing times we even improve upon the previously best known performance guarantee for stochastic parallel machine scheduling. Moreover, we derive some lower bounds on approximation.
Research partially supported by the DFG Research Center ”Mathematics for key technologies” (FZT 86) in Berlin.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bruno, J.L., Downey, P.J., Frederickson, G.N.: Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. J. ACM 28, 100–113 (1981)
Chakrabarti, S., Muthukrishnan, S.: Resource scheduling for parallel database and scientific applications. In: Proc. 8th Ann. ACM Symp. on Parallel Algorithms and Architectures, Padua, Italy, pp. 329–335 (1996)
Chekuri, C., Johnson, R., Motwani, R., Natarajan, B., Rau, B., Schlansker, M.: 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, pp. 58–69 (1996)
Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.): Deterministic and Stochastic Scheduling. D. Reidel Publishing Company, Dordrecht (1982)
Eastman, W., Even, S., Isaacs, I.: Bounds for the optimal scheduling of n jobs on m processors. Mgmt. Sci. 11, 268–279 (1964)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discr. Math. 5, 287–326 (1979)
Hall, W.J., Wellner, J.A.: Mean residual life. In: Csörgö, M., Dawson, D.A., Rao, J.N.K., Saleh, A.K.M.E. (eds.) Proc. Int. Symp. on Statistics and Related Topics, Ottawa, ON, pp. 169–184. North-Holland, Amsterdam (1981)
Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM J. Comp. 30, 300–317 (2000)
Megow, N., Schulz, A.S.: On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32(5), 485–490 (2004)
Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I: General strategies. ZOR - Zeitschrift für Oper. Res. 28, 193–260 (1984)
Möhring, R.H., Schulz, A.S., Uetz, M.: Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46, 924–942 (1999)
Rothkopf, M.H.: Scheduling with random service times. Mgmt. Sci. 12, 703–713 (1966)
Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. In: Proc. 34th Ann. ACM Symp. on the Theory of Computing, Montréal, QB, pp. 170–178 (2002)
Skutella, M., Uetz, M.: Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. In: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, Washington, DC, pp. 589–590 (2001)
Smith, W.: Various optimizers for single-stage production. Naval Res. Log. 3, 59–66 (1956)
Souza-Offermatt, A., Steger, A.: The expected competitive ratio for weighted completion time scheduling. In: Proc. 21st Symp. on Theoretical Aspects of Computer Science, Montpellier, France (2004) (to appear)
Uetz, M.: Algorithms for Deterministic and Stochastic Scheduling. PhD thesis, Cuvillier Verlag, Göttingen, Germany (2002)
Weiss, G.: Approximation results in parallel machines stochastic scheduling. Ann. Oper. Res. 26, 195–242 (1990)
Weiss, G.: Turnpike optimality of Smith’s rule in parallel machines stochastic scheduling. Math. Oper. Res. 17, 255–270 (1992)
Weiss, G., Pinedo, M.: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Prob. 17, 187–202 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Megow, N., Uetz, M., Vredeveld, T. (2005). Stochastic Online Scheduling on Parallel Machines. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11389811_15
Download citation
DOI: https://doi.org/10.1007/11389811_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24574-2
Online ISBN: 978-3-540-31833-0
eBook Packages: Computer ScienceComputer Science (R0)