##
**Theory of scheduling.
Reprint of the 1967 original.**
*(English)*
Zbl 1056.90001

Mineola, NY: Dover Publications (ISBN 0-486-42817-6/pbk). x, 294 p. (2003).

This book is an unabridged republication of the work originally published by Addison-Wesley Publishing Company, Reading, Massachusetts, in 1967. All specialists in scheduling are acquainted with this monograph (or at least have heard of it). Of course, since 1967 many new models and approaches have appeared in the scheduling theory. Without question, in the first turn this book is of historic interest. However, in some cases it may be as before of scientific interest.

Organized according to scheduling problem type, the book examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer.

In the introductory Chapters 1 through 2 problems of sequence and measures for schedule evaluation are considered.

In Chapters 3 through 7 static scheduling problems are treated. Topics include finite sequencing for a single machine, further problems with one operation per job, flow-shop scheduling, the general \(n/m\) job-shop problem, and general network problems related to scheduling.

In Chapters 8 through 11 dynamic problems are considered. Topics include 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.

The bibliography consists of 202 items published in 1951–1967.

Three appendixes give information on the Laplace-Stieltjes transform of a distribution function and experimental results for the \(n/m\) job-shop problem and for the continuous-process job-shop problem.

Organized according to scheduling problem type, the book examines three solution techniques: algebraic, probabilistic, and Monte Carlo simulation by computer.

In the introductory Chapters 1 through 2 problems of sequence and measures for schedule evaluation are considered.

In Chapters 3 through 7 static scheduling problems are treated. Topics include finite sequencing for a single machine, further problems with one operation per job, flow-shop scheduling, the general \(n/m\) job-shop problem, and general network problems related to scheduling.

In Chapters 8 through 11 dynamic problems are considered. Topics include 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.

The bibliography consists of 202 items published in 1951–1967.

Three appendixes give information on the Laplace-Stieltjes transform of a distribution function and experimental results for the \(n/m\) job-shop problem and for the continuous-process job-shop problem.

Reviewer: I. N. Lushchakova (Minsk)

### MSC:

90-02 | Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming |

90B10 | Deterministic network models in operations research |

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

90B22 | Queues and service in operations research |

90B35 | Deterministic scheduling theory in operations research |

90B36 | Stochastic scheduling theory in operations research |