×

Scheduling algorithms. 2nd rev. a. enl. ed. (English) Zbl 0914.90157

Berlin: Springer. xii, 342 p. (1998).
The book consists of three parts:
(a) the first part covers basic facts like the introduction, classification of scheduling problems, methods of combinatorial optimization and computational complexity (chapters 1–3),
(b) the second part deals with classical scheduling problems like single machine scheduling, parallel machine scheduling and shop scheduling problems and contains complexity results and algorithms for these problems (chapters 4–6).
(c) the third part is devoted to recent discussed problems in connection with flexible manufacturing. The author has considered scheduling with due dates, batching problems, scheduling with changeover and transportation times, multi-purpose machines and multiprocessor tasks (chapters 7–11).
In comparison with the first edition, the third part contains several new results in the area. Very useful are the new complexity columns at the end of each chapter (giving an overview about the complexity results) for all considered scheduling problems. Finally, there exists also a web page (see http://www.mathematik.uni-osnabrueck.de/research/OR/class/) provided by the author and Sigrid Knust where interested researchers can find new and updated complexity results for scheduling problems.
This book is an important reference and very good source of inspiration for advanced students and researchers in mathematics, computer science, operations research and industrial engineering.

MSC:

90B35 Deterministic scheduling theory in operations research
90-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90C60 Abstract computational complexity for mathematical programming problems
90B30 Production models
90C27 Combinatorial optimization

Citations:

Zbl 0839.90059
PDFBibTeX XMLCite