Common-Deadline Lazy Bureaucrat Scheduling Problems
暂无分享,去创建一个
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.
[1] Martti Penttonen,et al. Algorithm Theory — SWAT 2002 , 2002, Lecture Notes in Computer Science.
[2] Steven Skiena,et al. The Lazy Bureaucrat Scheduling Problem , 1999, WADS.
[3] Clifford Stein,et al. Minimizing Makespan for the Lazy Bureaucrat Problem , 2002, SWAT.
[4] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .