Abstract
Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin et al. (Inf. Comput. 184:129–146, 2003). 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. (Algorithms and data structures. Lecture notes in computer science, vol. 2748, pp. 59–66, 2003). We first show that the worst-case ratio of the algorithm SJF (Shortest Job First) is two under the objective function [min-time-spent], and thus answer an open question posed in (Esfahbod, et al. in Algorithms and data structures. Lecture notes in computer science, vol. 2748, pp. 59–66, 2003). We further present two approximation schemes A k and B k both having worst-case ratio of \(\frac{k+1}{k}\) , for any given integer k>0, under the objective functions [min-makespan] and [min-time-spent], respectively. Finally, we prove that the problem CD-LBSP remains NP-hard under several objective functions, even if all jobs share the same release time.
Similar content being viewed by others
References
Arkin EM, Bender MA, Mitchell JSB, Skiena SS (2003) The lazy bureaucrat scheduling problem. Inf Comput 184:129–146
Esfahbod B, Ghodsi M, Sharifi A (2003) Common-deadline lazy bureaucrat scheduling problems. In: Dehne FKHA, Sack J-R Smid MHM (eds) Algorithms and data structures. Lecture notes in computer science, vol 2748. Springer, Berlin, pp 59–66
Gary MR, Johnson DS (1979) A guide to the theory of NP-completeness. Freeman, San Francisco
Goemans MX, Williamaon DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42:1115–1145
Hassin R, Rubinstein S (1998) An approximation algorithm for the maximum traveling salesman problem. Inf Process Lett 67:125–130
Hepner C, Stein C (2002) Minimizing makespan for the lazy bureaucrat problem. In: Penttonen M Schmidt EM (eds) Algorithm theory. Lecture notes in computer science, vol 2368. Springer, Berlin, pp 40–50
Karger D, Motwani R, Ramkumar G (1997) On approximating the longest path in a graph. Algorithmica 18:82–98
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of the paper appeared in Proceedings of the 7th Latin American Symposium on Theoretical Informatics, pp 515–523, 2006.
Research of G. Zhang supported in part by NSFC (60573020).
Rights and permissions
About this article
Cite this article
Gai, L., Zhang, G. On lazy bureaucrat scheduling with common deadlines. J Comb Optim 15, 191–199 (2008). https://doi.org/10.1007/s10878-007-9076-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9076-2