Theory of Scheduling

by Richard W. Conway, William L. Maxwell, Louis W. Miller

This comprehensive text explores the mathematical models underlying the theory of scheduling. Organized according to scheduling problem type, it examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer. Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, and further problems with one operation per job. Additional chapters cover flow-shop scheduling, the general n/m job-shop problem, general network problems related to scheduling, selection disciplines in a single-server queuing system, single-server queuing systems with setup classes, multiple-server queuing models, and experimental investigation of the continuous job-shop process. 1967 edition.

304 pages, Paperback

First published January 1, 1967

Reviews

[Ushan · Rating 3 out of 5]

Scheduling and queueing theory in the happy days when computational complexity theory had just been invented by Hartmanis and Stearns, and NP-completeness was not yet discovered by Cook and Levin. A branch-and-bound routine is given for the Traveling Salesman (not yet Salesperson!) Problem, and it is mentioned that it takes time exponential in the size of the problem, but no rationale is given as to why this might be so. An appendix contains the results of simulations of several job shop scheduling problems on an IBM 7090 (32,768 36-bit words with access time 2.18us; fixed-point addition takes 4.36us). I wanted to buy a book on scheduling algorithms but instead bought a transistorpunk novel.

[Janet Alao]

nothing