Approximation Schemes for Constrained Scheduling Problems Author ： Leslie A. HalP 0. R. Center, M.I.T. David B. Shmoyst Dept. of Mathematics, M.I.T. 報告者：童耀民 2013/11/01

Outlino Introduction Two easy applications 2

Introduction Author consider several constrained machine scheduling problems, all of which are strongly NP-hard, and present the first polynomial approximation schemes for them. All of these algorithms are based on the notion of an outline, a set of information from 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. 3

Introduction 4

5

6

7

8 Completion time Starting time Processing time Delivery time Lateness time due dates Release date

9

10 Completion time M2 Starting time M2 Processing time