On lazy bureaucrat scheduling with common deadlines

On lazy bureaucrat scheduling with common deadlines

0.00 Avg rating—0 Votes
Article ID: iaor2009263
Country: Netherlands
Volume: 15
Issue: 2
Start Page Number: 191
End Page Number: 199
Publication Date: Feb 2008
Journal: Journal of Combinatorial Optimization
Authors: ,
Abstract:

Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin et al.. In this paper we focus on the case where all the jobs share a common deadline. Such a problem is denoted as CD-LBSP, which has been considered by Esfahbod et al..

Reviews

Required fields are marked *. Your email address will not be published.