This comprehensive text explores the mathematical models underlying the Theory of scheduling. 1967 edition..
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.
Topics include problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, and further problems with one operation per job.
Organized according to Scheduling problem type, it examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer.
This comprehensive text explores the mathematical models underlying the Theory of scheduling
