The Lazy Bureaucrat scheduling problem

Authors:
Esther M. Arkin;Michael A. Bender;Joseph S. B. Mitchell;Steven S. Skiena
Affiliations:
Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY;Department of Computer Science, State University of New York, Stony Brook, NY;Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY;Department of Computer Science, State University of New York, Stony Brook, NY
Venue:
Information and Computation
Year:
2003

Citing 8
Cited 6

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
An approximation algorithm for the maximum traveling salesman problem

Information Processing Letters
Approximating the throughput of multiple machines under real-time scheduling

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and Theory of Computation Handbook

Algorithms and Theory of Computation Handbook
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
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

The maximum resource bin packing problem

Theoretical Computer Science
Scheduling algorithms for procrastinators

Journal of Scheduling
The maximum resource bin packing problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Common deadline lazy bureaucrat scheduling revisited

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hardness of lazy packing and covering

Operations Research Letters
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation 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. A typical worker's objective is to minimize the amount of work he does (he is "lazy"), or more generally, to schedule as inefficiently (in some sense) as possible. The worker is subject to the constraint that he must be busy when there is work that he can do; we make this notion precise both in the preemptive and nonpreemptive settings. The resulting class of "perverse" scheduling preblems, which we denote "Lazy Bureaucrat Problems," gives rise to a rich set of new questions that explore the distinction between maximization and minimization in computing optimal schedules.