Skip to main content
SpringerLink
Log in

Minimizing Makespan for the Lazy Bureaucrat Problem

  • Conference paper
  • First Online:
Algorithm Theory — SWAT 2002 (SWAT 2002)

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

Included in the following conference series:

Abstract

We study the problem of minimizing makespan for the Lazy Bureaucrat Scheduling Problem. We give a pseudopolynomial time algorithm for a preemptive scheduling problem, resolving an open problem by Arkin et al. We also extend the definition of Lazy Bureaucrat scheduling to the multiple-bureaucrat (parallel) setting, and provide pseudopolynomial-time algorithms for problems in that model.

Research partially supported by NSF Grant EIA-98-02068, NSF Grant DMI-9970063 and an Alfred P. Sloan Foundation Fellowship

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

  1. E. M. Arkin, M. A. Bender, J. S. B. Mitchell, and S. S. Skiena. The lazy bureaucrat scheduling problem. WADS’99, 1999.

    Google Scholar 

  2. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287–326, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  3. T. Keneally. Schindler’s list. Touchstone Publishers, 1993.

    Google Scholar 

  4. E. L. Lawler and J. M. Moore. A functional equation and its application to resource allocation and sequencing problems. Management Science, 16:77–84, 1969.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Dartmouth College, Hanover, NH, 03755

    Clint Hepner

  2. Department of Industrial Engineering and Operations Research, Columbia University, New York NY, 10027

    Cliff Stein

Authors
  1. Clint Hepner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cliff Stein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Applied Mathematics, University of Kuopio, P.O. Box 1627, 70211, Kuopio, Finland

    Martti Penttonen

  2. BRICS, University of Aarhus, Department of Computer Science, NY Munkegade, 8000, Aarhus C, Denmark

    Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hepner, C., Stein, C. (2002). Minimizing Makespan for the Lazy Bureaucrat Problem. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45471-3_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation