Advertisement

Common-Deadline Lazy Bureaucrat Scheduling Problems

  • Behdad Esfahbod
  • Mohammad Ghodsi
  • Ali Sharifi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

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.

Keywords

Scheduling Problems Approximation Algorithms Dynamic Programming NP-hardness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.S.: The lazy bureaucrat scheduling problem. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 122–133. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  2. 2.
    Gary, M.R., Johnson, D.S.: Computers and intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)Google Scholar
  3. 3.
    Farzan, A., Ghodsi, M.: New results for lazy bureaucrat scheduling problem. In: 7th CSI Computer Conference (CSICC 2002), Iran Telecommunication Research Center, March 3–5, pp. 66–71 (2002) Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Behdad Esfahbod
    • 1
  • Mohammad Ghodsi
    • 1
  • Ali Sharifi
    • 1
  1. 1.Computer Engineering DepartmentSharif University of TechnologyTehranIran

Personalised recommendations