Loading...

Common-deadline lazy bureaucrat scheduling problems

Esfahbod, B ; Sharif University of Technology | 2003

184 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-45078-8_6
  3. Publisher: Springer Verlag , 2003
  4. Abstract:
  5. The lazy bureaucrat scheduling is a new class of scheduling problems that was introduced in [1]. In these problems, there is one employee (or more) who should perform the assigned jobs. The objective of the employee is to minimize the amount of work he performs and to be as inefficient as possible. He is subject to a constraint, however, that he should be busy when there is some work to do. In this paper, we focus on the cases of this problem where all jobs have the same common deadline. We show that with this constraint, the problem is still NP-hard, and prove some hardness results. We then present a tight 2-approximation algorithm for this problem under one of the defined objective functions. Moreover, we prove that this problem is weakly NP-hard under all objective functions, and present a pseudo-polynomial time algorithm for its general case. © Springer-Verlag Berlin Heidelberg 2003
  6. Keywords:
  7. Approximation Algorithms ; Dynamic Programming ; NP-hardness ; Scheduling Problems
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 2748 , 2003 , Pages 59-66 ; 03029743 (ISSN); 3540405453 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-45078-8_6