Lower bounds on precedence-constrained scheduling for parallel processors

https://doi.org/10.1016/S0020-0190(01)00303-9Get rights and content

Abstract

We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with release and due dates, giving a problem that can be efficiently solved. We demonstrate that recursively applying this approach yields a bound that is provably tighter than other known bounds, and experimentally shown to achieve the optimal value at least 90.3% of the time over a synthetic benchmark.

We compute the best known lower bound on weighted completion time scheduling by applying the recent discovery of a new algorithm for solving a related scheduling problem. Experiments show that this bound significantly outperforms the linear programming-based bound. We have therefore demonstrated that combinatorial algorithms can be a valuable alternative to linear programming for computing tight bounds on large scheduling problems.

References (14)

  • J.D. Ullman

    NP-complete scheduling problems

    J. Comput. Systems Sci.

    (1975)
  • I. Baev et al.

    Algorithms for total weighted completion time scheduling

  • P. Baptiste

    Scheduling equal-length jobs on identical parallel machines, Research Report

    (1998)
  • P. Brucker et al.

    Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness

    Math. Oper. Res.

    (1977)
  • J. Bruno et al.

    Scheduling independent tasks to reduce mean finishing time

    Comm. ACM

    (1974)
  • E. Coffman et al.

    Optimal scheduling for two-processor systems

    Acta Inform.

    (1972)
  • A. Eichenberger et al.

    Balance scheduling: Weighting branch tradeoffs in superblocks

There are more references available in the full text version of this article.

Cited by (3)

View full text