Advertisement

The Lazy Bureaucrat Scheduling Problem

  • Esther M. Arkin
  • Michael A. Bender
  • Joseph S. B. Mitchell
  • Steven S. Skiena
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)

Abstract

We introduce a new class of scheduling problems in which the optimization is performed by the worker (single “machine”) who performs the tasks. The worker’s objective may be to minimize the amount of work he does (he is “lazy”). He is subject to a constraint that he must be busy when there is work that he can do; we make this notion precise, particularly when preemption is allowed. The resulting class of “perverse” scheduling problems, which we term “Lazy Bureaucrat Problems,” gives rise to a rich set of new questions that explore the distinction between maximization and minimization in computing optimal schedules.

Keywords

Arrival Time Schedule Problem Optimal Schedule Dynamic Programming Algorithm Feasible Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of real-time multiple machine scheduling. In Proc. 31st ACM Symp. Theory of Computing, 1999.Google Scholar
  2. 2.
    M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.zbMATHGoogle Scholar
  3. 3.
    D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.Google Scholar
  4. 4.
    T. Keneally. Schindler’s List. Touchstone Publishers, New York, 1993.Google Scholar
  5. 5.
    E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: Algorithms and complexity. In Handbooks of Operations Research and Management Science, volume 4, pages 445–522. Elsevier Science Publishers B.V., 1993.CrossRefGoogle Scholar
  6. 6.
    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.zbMATHCrossRefGoogle Scholar
  7. 7.
    M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Esther M. Arkin
    • 1
  • Michael A. Bender
    • 2
  • Joseph S. B. Mitchell
    • 1
  • Steven S. Skiena
    • 2
  1. 1.Department of Applied Mathematics and StatisticsStony BrookUSA
  2. 2.Department of Computer ScienceState University of New YorkStony BrookUSA

Personalised recommendations