Formulations, Relaxations, Approximations, and Gaps in the World of Scheduling
Author:
Woeginger Gerhard J.
Publisher
Springer-Verlag
Reference24 articles.
1. Chekuri, C. and Motwani, R. (1999). Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics, 98:29–38.
2. Chekuri, C., Motwani, R., Natarajan, B. and Stein, C. (2001). Approximation techniques for average completion time scheduling. SIAM Journal on Computing, 31:146–166.
3. Chudak, F. and Hochbaum, D. S. (1999). A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters, 25:199–204.
4. Dyer, M. E. and Wolsey, L. A. (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics, 26:255–270.
5. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability. Freeman, New York.