1. Dean, B. C. (2005). Approximation algorithms for stochastic scheduling problems. PhD thesis, MIT. www.cs.clemson.edu/~bcdean/bdean_phd_thesis.pdf.
2. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project, University of California, Los Angeles.
3. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.
4. Law, A. M., & Kelton, W. D. (2000). Simulation modeling and analysis. New York: McGraw–Hill.
5. Lawler, E. L. (unpublished) Scheduling a single machine to minimize the number of late jobs. Unpublished manuscript.