Papers to Read

Hard Copies

  1. L. A. Hall. Approximation Algorithms for NP-hard problems, Chapter 1. PWS Publishing Company, 1997. D. Hochbaum, editor.
  2. L. Hall and D. B. Shmoys. Approximation schemes for constrained scheduling problems. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science , pages 134--141. IEEE, October 1989.

On-line

  1. K. R. Baker, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 31:381--386, 1983. pdf file
  2. C. Chekuri, R. Motwani, B. Natarajan, C. Stein. Approximation techniques for average completion time scheduling. SIAM J. Computing. 31 (1): 146--166, 2001. ps file
  3. H. Gabow. A linear-time algorithm for two processor scheduling. Journal of the ACM, 29:766--780, 1982. pdf file
  4. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM , 34:144--162, 1987. pdf file
  5. D. Karger , J. Wein and C. Stein. Scheduling Algorithms. In CRC Handbook on Algorithms . CRC Press. 1998. ps file
  6. L.A. Hall, A. S. Schulz, D.B. Shmoys, and J. Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms". Mathematics of Operations Research 22: 513-544, `997. ps file
  7. H. Kellerer and T. Tautenhahn and G. J. Woeginger. Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine . SIAM Journal on Computing, 1999, Vol. 28 Issue 4, p1155--1167 ps file
  8. Bala Kalyanahsundaram and Kirk Pruhs, Speed is as powerful as clairvoyance. Journal of the ACM 47 (4) : 617--643, 2000 ps file
  9. E.L. Lawler and J.Labetoulle. On preeemptive scheduling of of unrelated parallel processors by linear programming. Journal of the ACM, 25:612--619, 1978. pdf file
  10. R. McNaughton. Scheduling with deadlines and loss functions. Management Science , 6:1--12, 1959. pdf file
  11. Cynthia A. Phillips and Cliff Stein and Eric Torng and Joel Wein. Optimal time-critical scheduling via resource augmentation. Algorithmica 32: 163--2000, 2001. ps file
  12. C. Phillips, C. Stein and J. Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming A, 82: 199--223, 1998. ps file
  13. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A , 62:461--474, 1993. pdf file