LNCS 2748 – Common-Deadline Lazy Bureaucrat Scheduling Problems 1st Edition by Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi – Ebook PDF Instant Download/Delivery. 3540450785, 9783540450788
Full download LNCS 2748 – Common-Deadline Lazy Bureaucrat Scheduling Problems 1st Edition after payment
Product details:
ISBN 10: 3540450785
ISBN 13: 9783540450788
Author: Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
LNCS 2748 – Common-Deadline Lazy Bureaucrat Scheduling Problems 1st Edition:
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.
LNCS 2748 – Common-Deadline Lazy Bureaucrat Scheduling Problems 1st Edition Table of contents:
1 Introduction
1.1 Objective Functions
1.2 Previous Related Results
1.3 Our Results
2 Hardness Results
3 Approximation Algorithm
4 Pseudo-Polynomial Time Algorithms
5 Conclusion
People also search for LNCS 2748 – Common-Deadline Lazy Bureaucrat Scheduling Problems 1st Edition:
c lazy b trucking
lazy boy schedule delivery
klearvue lazy susan shelf adjustment
klearvue lazy susan shelf
klëarvūe lazy susan adjustment