The Lazy Bureaucrat Scheduling Problem
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.
KeywordsArrival Time Schedule Problem Optimal Schedule Dynamic Programming Algorithm Feasible Schedule
Unable to display preview. Download preview PDF.
- 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
- 3.D. Karger, C. Stein, and J. Wein. Scheduling algorithms. In CRC Handbook of Computer Science, 1997. To appear.Google Scholar
- 4.T. Keneally. Schindler’s List. Touchstone Publishers, New York, 1993.Google Scholar
- 7.M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.Google Scholar