The Lazy Bureaucrat Scheduling Problem
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 problems, 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.
 Publication:

arXiv eprints
 Pub Date:
 October 2002
 arXiv:
 arXiv:cs/0210024
 Bibcode:
 2002cs.......10024A
 Keywords:

 Computer Science  Data Structures and Algorithms;
 Computer Science  Discrete Mathematics;
 F.2.2;
 I.2.8
 EPrint:
 19 pages, 2 figures, Latex. To appear, Information and Computation