Skip to main content
SpringerLink
Log in

Lower Bounds for On-Line Single-Machine Scheduling

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

Abstract

The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total flow time. By using new techniques, we provide the first lower bounds for several of these problems, and we significantly improve the bounds that were known.

Research supported by the Netherlands Organization for Scientific Research (NWO), project number SION 612-30-002.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

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

    Google Scholar 

  2. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

    Google Scholar 

  3. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In Proc. of the 33th Symp. on Theory of Computing (STOC), 2001.

    Google Scholar 

  4. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms (SODA’97), pages 609–618. SIAM, Philadelphia, PA, 1997.

    Google Scholar 

  5. M. X. Goemans, M. Queyranne, A. S. Schulz, M. Skutella, and Y. Wang. Single machine scheduling with release dates. manuscript, 1999.

    Google Scholar 

  6. Michel X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 591–598, New York / Philadelphia, 1997. ACM / SIAM.

    Google Scholar 

  7. J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proc. 5th Int. Conf. Integer Programming and COmbinatorial Optimization, LNCS, pages 404–414. Springer, 1996.

    Google Scholar 

  8. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 418–426, Philadelphia, Pennsylvania, 1996.

    Google Scholar 

  9. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of uniform machines subject to release dates. Progress in Combinatorial Optimization, pages 245–261, 1984.

    Google Scholar 

  10. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: algorithms and complexity. In Handbooks in operations research and management science, volume 4, pages 445–522. North Holland, 1993.

    Article  Google Scholar 

  11. C. A. Phillips, C. Stein, and J. Wein. Scheduling jobs that arrive over time. In Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS’95), volume 955 of Lecture Notes in Computer Science, pages 86–97. Springer, 1995.

    Google Scholar 

  12. A. S. Schulz and M. Skutella. The power of alpha-points in preemptive single machine scheduling. manuscript, 1999.

    Google Scholar 

  13. M. Skutella. personal communication, 2000.

    Google Scholar 

  14. W. E. Smith. Various optimizers for single-stage production. Naval Research and Logistics Quarterly, 3:59–66, 1956.

    Article  MathSciNet  Google Scholar 

  15. L. Stougie. Unpublished manuscript, 1995.

    Google Scholar 

  16. L. Stougie and A. P. A. Vestjens. Randomized on-line scheduling: How low can’t you go? Unpublished manuscript, 1997.

    Google Scholar 

  17. A. P. A. Vestjens. On-line machine scheduling. Technical report, Ph.D. thesis, Eindhoven University of Technology, The Netherlands, 1997.

    Google Scholar 

  18. A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 18th Annual Symposium on Foundations of Computer Science, pages 222–227. IEEE, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Media Sciences, The Interdisciplinary Center, Herzliya, Israel

    Leah Epstein

  2. Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands

    Rob van Stee

Authors
  1. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rob van Stee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Epstein, L., van Stee, R. (2001). Lower Bounds for On-Line Single-Machine Scheduling. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation