© 2012

Complex Scheduling


Part of the GOR-Publications book series (GOR)

Table of contents

  1. Front Matter
    Pages i-x
  2. Peter Brucker, Sigrid Knust
    Pages 1-28
  3. Peter Brucker, Sigrid Knust
    Pages 29-115
  4. Peter Brucker, Sigrid Knust
    Pages 117-238
  5. Peter Brucker, Sigrid Knust
    Pages 239-317
  6. Back Matter
    Pages 319-340

About this book



GOR   The German Society of Operations Research - and its members provide numerous significant contributions to Operations Research/Management Science, with respect to both theory and practice. In order to demonstrate the high standards of these contributions and to make them more easily available, in particular to researchers and practitioners from outside the German-speaking countries, GOR has created this book series. It publishes high-quality monographs and collections of papers on all aspects of Operations Research/Management Science, which deal with a single topic of current interest and originate from or are related to the activities of GOR.

Back cover copy text:

This book presents models and algorithms for complex schedul-
ing problems. Besides resource-constrained project scheduling
problems with applications also job-shop problems with flexible
machines, transportation or limited buffers are discussed. Dis-
crete optimization methods like linear and integer program-
ming, constraint propagation techniques, shortest path and net-
work flow algorithms, branch-and-bound methods, local search
and genetic algorithms, and dynamic programming are present-
ed. They are used in exact or heuristic procedures to solve the
introduced complex scheduling problems. Furthermore, meth-
ods for calculating lower bounds are described. Most algorithms
are formulated in detail and illustrated with examples.

In this second edition some errors were corrected, some parts were
explained in more detail, and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.


Algorithms Applications Combinatorial Optimization Project Scheduling Scheduling

Authors and affiliations

  1. 1.FB Mathematik und Informatik, Institut für MathematikUniversität OsnabrückOsnabrückGermany
  2. 2.FB Mathematik und Informatik, Institut für InformatikUniversität OsnabrückOsnabrückGermany

Bibliographic information

Industry Sectors
Consumer Packaged Goods
Finance, Business & Banking
Energy, Utilities & Environment


From the reviews of the second edition:

“This book is a joint production by two veteran researchers in the field of scheduling algorithms. This second edition comes six years after the first and adds close to 60 pages of new material. Most notable is the addition of information on the resource-constrained project scheduling problem (RCPSP), which represents the major focus application of many of the techniques presented in the four sections of the book. … This book clearly reflects the authors’ efforts and is a serious treatment of the topic.” (Minette Carl, ACM Computing Reviews, June, 2012)