Minimizing Makespan for the Lazy Bureaucrat Problem

Authors:
Clint Hepner;Clifford Stein
Affiliations:
-;-
Venue:
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Year:
2002

Citing 1
Cited 4

The Lazy Bureaucrat Scheduling Problem

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures

The Lazy Bureaucrat scheduling problem

Information and Computation
Scheduling algorithms for procrastinators

Journal of Scheduling
Common deadline lazy bureaucrat scheduling revisited

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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 study the problem of minimizing makespan for the Lazy Bureaucrat Scheduling Problem. We give a pseudopolynomial time algorithm for a preemptive scheduling problem, resolving an open problem by Arkin et al. We also extend the definition of Lazy Bureaucrat scheduling to the multiple-bureaucrat (parallel) setting, and provide pseudopolynomial-time algorithms for problems in that model.