More titles to consider

Shopping Cart

itemsitem

Synopsis

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.

People who read this also enjoyed

Get a 1 year subscription
for / issue

You can read this item using any of the following Kobo apps and devices:

  • DESKTOP
  • eREADERS
  • TABLETS
  • IOS
  • ANDROID
  • BLACKBERRY
  • WINDOWS