Abstract
Lazy bureaucrat scheduling is a new class of scheduling problems introduced by Arkin et al. [1]. 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. [2]. 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 [2]. 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 function [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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by NSFC grant No. 10231060 and No. 60573020.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.S.: The lazy bureaucrat scheduling problem. Information and Computation 184, 129–146 (2003)
Esfahbod, B., Ghodsi, M., Sharifi, A.: Common-deadline lazy bureaucrat scheduling problems. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 59–66. Springer, Heidelberg (2003)
Goemans, M.X., Williamaon, D.P.: Improved approximation algorithms for maixmum cut and satisfiability problems using semidefinite programming. Journal of ACM 42, 1115–1145 (1995)
Hassin, R., Rubinstein, S.: An approximation algorithm for the maximum traveling salesman problem. Information Processing Letter 67, 125–130 (1998)
Hepner, C., Stein, C.: Minimizing makespan for the lazy bureaucrat problem. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 40–50. Springer, Heidelberg (2002)
Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a graph. Algorithmica 18, 82–98 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gai, L., Zhang, G. (2006). Common Deadline Lazy Bureaucrat Scheduling Revisited. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_48
Download citation
DOI: https://doi.org/10.1007/11682462_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)