Suggested Readings

BRUCKER, P. Scheduling Algorithms, 4th ed., SpringerVerlag, Heidelberg, Germany, 2004. A detailed mathematical look at scheduling.

GRAHAM, RONALD. Combinatorial scheduling theory, in Lynn Steen (ed.), Mathematics Today, Springer-Verlag, New York, 1978, pp. 183–211. This essay on scheduling is one of many excellent accounts of later 20th-century developments in mathematics in this book.

GRAHAM, RONALD. The combinatorial mathematics of scheduling. Scientific American, March 1978, pp. 124–32. A very readable introduction to scheduling and bin packing.

JENSEN, T. R., and BJARNE TOFT. Graph Coloring Problems, Wiley, New York, 1995. A detailed summary of what is known about coloring problems and many questions that await answering.

124

LAWLER, E., et al. Sequencing and scheduling algorithms and complexity, in S. C. Graves et al. (Eds.), Handbooks in OR and MS, Vol. 4, Elsevier, New York, 1993, pp. 445–522. A survey of results about scheduling.

LEUNG, JOSEPH Y-T. Handbook of Scheduling, Chapman & Hall/CRC, Boca Raton, FL, 2004. This book offers an encyclopedic treatment of scheduling algorithms and the great variety of situations where mathematical analysis has assisted schedulers, ranging from sports to hospitals.

PARKER, R. GARY. Deterministic Scheduling Theory, Chapman & Hall, London, 1995. A wide-ranging look at scheduling methods and their applications.