… of scheduling problem, which we term the “Lazy Bureaucrat Problem” (LBP); the goal of the
LBP is to schedule … There exists a vast literature on scheduling; see, eg, some of the recent …

… of scheduling problem, which we term the "Lazy Bureaucrat Problem" (LBP), in which the
goal is to schedule … We propose that these problems provide an interesting set of algorithmic …

… In this problem, the bureaucrat wants to do things as little (or easy) as … scheduling problem.
Of course there is a basic assumption, called the busy requirement, that the bureaucrat must …

… We call such employees lazy, and such scheduling problems … class of the Lazy Bureaucrat
Scheduling Problems (LBSP), … We proved that this problem is still NP-hard under all four pre…

… We study the lazy bureaucrat scheduling problem with common arrival times and common
deadlines, but we just name it the Lazy Bureaucrat Problem for the sake of simplicity. The …

… lazy bureaucrat scheduling problems. In this new class of scheduling problems there is a lazy
… as possible, in contrast to traditional scheduling problems in which the main objective is to …

… Abstract: In this paper we consider the game theoretical issue of the lazy bureaucrat
scheduling problem. There are two players working on a pool of tasks, each of them can select a …

… Instead of the original scheduling problem we will show the NP-hardness for a slightly …
is “no”, we will show that the makespan of any feasible schedule of the scheduling problem is …

… In this paper we consider the online lazy bureaucrat scheduling problem with a machine …
In this paper we consider the online version of the lazy bureaucrat scheduling problem with a …

… The lazy bureaucrat problem is a scheduling problem in … We will consider a special variant
of this problem in which all jobs … refer to this problem as the Lazy Bureaucrat Problem (LBP). …