The Lazy Bureaucrat Scheduling Problem

Details The Lazy Bureaucrat Scheduling Problem The Lazy Bureaucrat Scheduling Problem

2002-10-26

arxiv.org/abs/cs/0210024v1

Computer Science

Data Structures and Algorithms

19 pages, 2 figures, Latex. To appear, Information and Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Lazy Bureaucrat Scheduling Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Lazy Bureaucrat Scheduling Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Lazy Bureaucrat Scheduling Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-409042