Skip to main content
SpringerLink
Log in
Book cover

International Conference on Integer Programming and Combinatorial Optimization

IPCO 2017: Integer Programming and Combinatorial Optimization pp 228–240Cite as

Stochastic Online Scheduling on Unrelated Machines

  • Conference paper
  • First Online:

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

Abstract

We derive the first performance guarantees for a combinatorial online algorithm that schedules stochastic, nonpreemptive jobs on unrelated machines to minimize the expectation of the total weighted completion time. Prior work on unrelated machine scheduling with stochastic jobs was restricted to the offline case, and required sophisticated linear or convex programming relaxations for the assignment of jobs to machines. Our algorithm is purely combinatorial, and therefore it also works for the online setting. As to the techniques applied, this paper shows how the dual fitting technique can be put to work for stochastic and nonpreemptive scheduling problems.

B. Moseley—Supported in part by a Google Research Award, a Yahoo Research Award and NSF Grant CCF-1617724.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    The ratio is slightly better, but for simplicity we ignore the additive \(\varTheta (1/m)\) term.

References

  1. Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1228–1241 (2012)

    Google Scholar 

  2. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: Proceedings of the 15th Symposium on Parallelism in Algorithms and Architectures (SPAA 2003), pp. 11–18. ACM (2003)

    Google Scholar 

  3. Balseiro, S., Brown, D., Chen, C.: Static routing in stochastic scheduling: Performance guarantees and asymptotic optimality. Technical report (2016)

    Google Scholar 

  4. Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of 48th Annual ACM Symposium Theory Computing (STOC), pp. 156–167. ACM (2016)

    Google Scholar 

  5. Becchetti, L., Leonardi, S.: Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. In: STOC, pp. 94–103 (2001)

    Google Scholar 

  6. Bruno, J., Downey, P.J., Frederickson, G.: Sequencing tasks with exponential service times to minimize the expected flowtime or makespan. J. ACM 28, 100–113 (1981)

    Article  MATH  Google Scholar 

  7. Correa, J., Wagner, M.: LP-based online scheduling: from single to parallel machines. Math. Program. 119, 109–136 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  9. Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn’t as easy as you think. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, pp. 1242–1253 (2012)

    Google Scholar 

  10. Gupta, V., Moseley, B., Uetz, M., Xie, Q.: Stochastic online scheduling on unrelated machines. arXiv preprint arXiv:1703.01634 (2017)

  11. Horn, W.: Minimizing average flowtime with parallel machines. Oper. Res. 21, 846–847 (1973)

    Article  MATH  Google Scholar 

  12. Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling nonidentical processors. J. ACM 23(2), 317–327 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Im, S., Kulkarni, J., Munagala, K., Pruhs, K.: Selfishmigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 531–540 (2014)

    Google Scholar 

  14. Im, S., Moseley, B., Pruhs, K.: A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2), 83–97 (2011)

    Article  Google Scholar 

  15. Im, S., Moseley, B., Pruhs, K.: Stochastic scheduling of heavy-tailed jobs. In: STACS (2015)

    Google Scholar 

  16. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kämpke, T.: On the optimality of static priority policies in stochastic scheduling on parallel machines. J. Appl. Probab. 24, 430–448 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lenstra, J., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259–271 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  19. Leung, J.Y.-T. (ed.): Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman & Hall/CRC, Boca Raton (2004)

    MATH  Google Scholar 

  20. Megow, N., Schulz, A.: On-line scheduling to minimize average completion time revisited. Oper. Res. Lett. 32, 485–490 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  21. Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31(3), 513–525 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Megow, N., Vredeveld, T.: A tight 2-approximation for preemptive stochastic scheduling. Math. Oper. Res. 39, 1297–1310 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  23. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I: general strategies. ZOR - Z. Oper. Res. 28, 193–260 (1984)

    MathSciNet  MATH  Google Scholar 

  24. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems II: set strategies. ZOR - Z. Oper. Res. 29, 65–104 (1985)

    MathSciNet  MATH  Google Scholar 

  25. 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)

    Article  MathSciNet  MATH  Google Scholar 

  26. Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130(1), 17–47 (1994)

    Article  MATH  Google Scholar 

  27. Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis. CRC Press, Boca Raton (2004)

    Google Scholar 

  28. Rothkopf, M.H.: Scheduling with random service times. Manage. Sci. 12, 703–713 (1966)

    MathSciNet  MATH  Google Scholar 

  29. Schulz, A.S.: Stochastic online scheduling revisited. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 448–457. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85097-7_42

    Chapter  Google Scholar 

  30. Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48, 206–242 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  31. Skutella, M., Sviridenko, M., Uetz, M.: Unrelated machine scheduling with stochastic processing times. Math. Oper. Res. 41(3), 851–864 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  32. Skutella, M., Uetz, M.: Stochastic machine scheduling with precedence constraints. SIAM J. Comput. 34, 788–802 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  33. Uetz, M.: When greediness fails: examples from stochastic scheduling. Oper. Res. Lett. 31, 413–419 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  34. Weber, R., Varaiya, P., Walrand, J.: Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected owtime. J. Appl. Probab. 23, 841–847 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  35. Weiss, G., Pinedo, M.: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Probab. 17, 187–202 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was done while all four authors were with the Simons Institute for the Theory of Computing at UC Berkeley. The authors wish to thank the institute for the financial support and the organizers of the semester on “Algorithms & Uncertainty” for providing a very stimulating atmosphere.

Author information

Authors and Affiliations

  1. University of Chicago, Chicago, USA

    Varun Gupta

  2. Washington University in St. Louis, St. Louis, USA

    Benjamin Moseley

  3. University of Twente, Enschede, Netherlands

    Marc Uetz

  4. University of Illinois at Urbana-Champaign, Champaign, USA

    Qiaomin Xie

Authors
  1. Varun Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Moseley
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marc Uetz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qiaomin Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marc Uetz .

Editor information

Editors and Affiliations

  1. Ecole Polytechnique Federale de Lausanne - EPFL, Lausanne, Switzerland

    Friedrich Eisenbrand

  2. University of Waterloo, Waterloo, Ontario, Canada

    Jochen Koenemann

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Gupta, V., Moseley, B., Uetz, M., Xie, Q. (2017). Stochastic Online Scheduling on Unrelated Machines. In: Eisenbrand, F., Koenemann, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2017. Lecture Notes in Computer Science(), vol 10328. Springer, Cham. https://doi.org/10.1007/978-3-319-59250-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59250-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59249-7

  • Online ISBN: 978-3-319-59250-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation