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.
Partially supported by NSF (CCR-9732220).
Partially supported by Boeing, Bridgeport Machines, Sandia National Labs, Seagull Technologies, Sun Microsystems, and NSF (CCR-9732220).
Partially supported by NSF (CCR-9625669), and ONR (431-0857A).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.
T. Keneally. Schindler’s List. Touchstone Publishers, New York, 1993.
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.
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.
M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.S. (1999). The Lazy Bureaucrat Scheduling Problem. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive