The Community for Technology Leaders
30th Annual Symposium on Foundations of Computer Science (1989)
Research Triangle Park, NC, USA
Oct. 30, 1989 to Nov. 1, 1989
ISBN: 0-8186-1982-1
pp: 134-139
L.A. Hall , MIT, Cambridge, MA, USA
Several constrained scheduling problems are considered. The first polynomial approximation schemes for the problem of minimizing maximum completion time in a two-machine flow shop with release dates and for the problem of minimizing maximum lateness for the single and parallel-machine problem with release dates are described. All of these algorithms are based upon the notion of an outline, a set of information with which it is possible to compute, with relatively simple procedures and in polynomial time, an optimal or near-optimal solution to the problem instance under consideration. Two related precedence-constrained scheduling problems are discussed, and new approximation results are presented.
precedence-constrained scheduling problems, minimisation, single machine problem, constrained scheduling problems, polynomial approximation, maximum completion time, two-machine flow shop, release dates, maximum lateness, parallel-machine problem, outline

D. Shmoys and L. Hall, "Approximation schemes for constrained scheduling problems," 30th Annual Symposium on Foundations of Computer Science(FOCS), Research Triangle Park, NC, USA, 1989, pp. 134-139.
88 ms
(Ver 3.3 (11022016))