The Lazy Bureaucrat Scheduling Problem

Authors:
Esther M. Arkin;Michael A. Bender;Joseph S. B. Mitchell;Steven Skiena
Affiliations:
-;-;-;-
Venue:
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Year:
1999

Citing 2
Cited 1

Approximating the throughput of multiple machines under real-time scheduling

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Minimizing Makespan for the Lazy Bureaucrat Problem

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

Quantified Score

Hi-index	0.00

Visualization

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.