Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Stochastic Online Scheduling Revisited

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5165))

Abstract

We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give randomized as well as deterministic online and off-line algorithms that have the best known performance guarantees in either setting, deterministic and off-line or randomized and online. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems, which can be solved online.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–43 (1999)

    Google Scholar 

  • Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  • Chakrabarti, S., Phillips, C., Schulz, A., Shmoys, D., Stein, C., Wein, J.: Improved scheduling algorithms for minsum criteria. In: auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 646–657. Springer, Heidelberg (1996)

    Google Scholar 

  • Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. SIAM Journal on Computing 31, 146–166 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Chou, M., Liu, H., Queyranne, M., Simchi-Levi, D.: On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions. Operations Research 54, 464–474 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Chou, M., Queyranne, M., Simchi-Levi, D.: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Mathematical Programming 106, 137–157 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Correa, J., Wagner, M.: LP-based online scheduling: From single to parallel machines. Mathematical Programming (in press, 2008)

    Google Scholar 

  • Goemans, M., Queyranne, M., Schulz, A., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics 15, 165–192 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Hall, L., Schulz, A., Shmoys, D., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  • Hall, W., Wellner, J.: Mean residual life. In: Csörgö, M., Dawson, D., Rao, J., Saleh, A.E. (eds.) Proceedings of the International Symposium on Statistics and Related Topics, pp. 169–184 (1981)

    Google Scholar 

  • Kämpke, T.: On the optimality of static priority policies in stochastic scheduling on parallel machines. Journal of Applied Probability 24, 430–448 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  • Lenstra, J., Rinnooy Kan, A., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)

    Article  MathSciNet  Google Scholar 

  • Megow, N., Schulz, A.: On-line scheduling to minimize average completion time revisited. Operations Research Letters 32, 485–490 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  • Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Mathematics of Operations Research 31, 513–525 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  • Megow, N., Vredeveld, T.: Approximation results for preemptive stochastic online scheduling. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 516–527. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  • Möhring, R., Radermacher, F., Weiss, G.: Stochastic scheduling problems I: General strategies. Zeitschrift für Operations Research 28, 193–260 (1984)

    Article  MATH  Google Scholar 

  • Möhring, R., Schulz, A., Uetz, M.: Approximation in stochastic scheduling: The power of LP-based priority policies. Journal of the ACM 46, 924–942 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Queyranne, M., Schulz, A.: Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 307–320. Springer, Heidelberg (1995)

    Google Scholar 

  • Rothkopf, M.: Scheduling with random service times. Management Science 12, 703–713 (1966)

    MathSciNet  Google Scholar 

  • Schulz, A., Skutella, M.: The power of α-points in preemptive single machine scheduling. Journal of Scheduling 5, 121–133 (2002a)

    Article  MATH  MathSciNet  Google Scholar 

  • Schulz, A., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics 15, 450–469 (2002b)

    Article  MATH  MathSciNet  Google Scholar 

  • Sgall, J.: On-line scheduling. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms: The State of the Art. LNCS, vol. 1442, ch. 9, pp. 196–231. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  • Skutella, M., Uetz, M.: Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing 34, 788–802 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Sousa, J.: Time Indexed Formulations of Non-Preemptive Single-Machine Scheduling Problems. Ph.D. thesis, Université Catholique de Louvain, Belgium (1989)

    Google Scholar 

  • Spencer, J.: Ten Lectures on the Probabilistic Method. CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 52. SIAM, Philadelphia (1987)

    MATH  Google Scholar 

  • Weber, R., Varaiya, P., Walrand, J.: Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime. Journal of Applied Probability 23, 841–847 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • Weiss, G.: Approximation results in parallel machines stochastic scheduling. Annals of Operations Research 26, 195–242 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  • Weiss, G., Pinedo, M.: Scheduling tasks with exponential service times on nonidentical processors to minimize various cost functions. Journal of Applied Probability 17, 187–202 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sloan School of Management, Massachusetts Institute of Technology,  , E53-361, 77 Massachusetts Avenue, Cambridge, MA 02139, USA

    Andreas S. Schulz

Authors
  1. Andreas S. Schulz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Boting Yang Ding-Zhu Du Cao An Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schulz, A.S. (2008). Stochastic Online Scheduling Revisited. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85097-7_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85096-0

  • Online ISBN: 978-3-540-85097-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation