Preemptive Scheduling of. Precedence-Constrained Jobs on Parallel Machines

  • E. L. Lawler
Part of the NATO Advanced Study Institutes Series book series (ASIC, volume 84)

Abstract

Polynomial time-bounded algorithms are presented for solving three problems involving the preemptive scheduling of precedence-constrained jobs on parallel machines: the “intree problem”, the “two-machine problem with equal release dates”, and the “general two-machine problem”. These problems are preemptive counterparts of problems involving the nonpreemptive scheduling of unit-time jobs previously solved by Brucker, Garey and Johnson and by Garey and Johnson. The algorithms and proofs (and the running times of the algorithms) closely parallel those presented in their papers. These results improve on previous results in preemptive scheduling and also suggest a close relationship between preemptive scheduling problems and problems in nonpreemptive scheduling of unit-time jobs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. Brucker, M.R. Garey, D.S. Johnson (1977) Scheduling equal length tasks under tree-like precedence constraints to minimize maximum lateness. Math. Oper. Res. 2, 275–284.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    M.R. Garey, D.S. Johnson (1976) Scheduling tasks with non-uniform deadlines on two processors. J. Assoc. Comput. Mach. 23, 461–467.MathSciNetMATHGoogle Scholar
  3. 3.
    M.R. Garey, D.S. Johnson (1977) Two-processor scheduling with start times and deadlines. SIAM J. Comput. 6, 416–426.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    T.F. Gonzalez, D.B. Johnson (1980) A new algorithm for preemptive scheduling of trees. J. Assoc. Comput. Mach. 27, 287–312.MathSciNetMATHGoogle Scholar
  5. 5.
    R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326.MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    E.C. Horvath, S. Lam, R. Sethi (1977) A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach. 24, 32–43.MathSciNetMATHGoogle Scholar
  7. 7.
    J.K. Lenstra. Private communication.Google Scholar
  8. 8.
    N. Megiddo (1979) Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414–423.MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    C.L. Monma (1979) Linear-time algorithm for scheduling equal-length tasks with due dates subject to precedence constraints. Technical Memorandum 79-1712, Bell Laboratories, Holmdel, NJ.Google Scholar
  10. 10.
    R.R. Muntz, E.G. Coffman, Jr. (1969) Optimal preemptive scheduling on two-processor systems. IEEE Trans. Comput. C-18, 1014–1020.CrossRefGoogle Scholar
  11. 11.
    R.R. Muntz, E.G. Coffman, Jr. (1970) Preemptive scheduling of real-time tasks on multiprocessor systems. J. Assoc. Comput. Mach. 2, 324–338.MathSciNetGoogle Scholar
  12. 12.
    S. Sahni, Y. Cho (1979) Nearly on line scheduling of a uniform processor system with release times. SIAM J. Comput. 8, 275–285.MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    J.D. Ullman (1975) NP-Complete scheduling problems. J. Comput. System Sci. 10, 384–393.MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    J.D. Ullman (1976) Complexity of sequencing problems. In: E.G. Coffman, Jr. (ed.) (1976) Computer & Job/Shop Scheduling Theory, Wiley, New York, 139–164Google Scholar

Copyright information

© D. Reidel Publishing Company 1982

Authors and Affiliations

  • E. L. Lawler
    • 1
  1. 1.University of CaliforniaBerkeleyUSA

Personalised recommendations