Scheduling algorithms. (Q4396949)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1167865
Language Label Description Also known as
default for all languages
No label defined
    English
    Scheduling algorithms.
    scientific article; zbMATH DE number 1167865

      Statements

      0 references
      18 June 1998
      0 references
      Scheduling algorithms. (English)
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references