Complex Scheduling

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:
In this revised edition some errors were corrected and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.
Since in recent years commercial and non-commercial solvers for mixed integer linear programs or satisfiability problems became much more efficient, they may be a good alternative for calculating exact (or heuristic) solutions. Hence, we provided new sections on MIP-formulations and a SAT-formulation for the RCPSP. Furthermore, a description of ant colony optimization was added to the section on heuristic methods for solving the RCPSP. The section on lower bounds was augmented by bounds based on Lagrangian relaxation. In connection with the new methods for solving the RCPSP, basic concepts for SAT solvers, Lagrangian relaxation, and ant colony optimization have been added to Chapter 2. We also wrote a new basic section on constraint programming and corrected the input-or-output test. In this revised edition some errors were corrected and new material has been added. In particular, further generalizations of the RCPSP, additional practical applications and some more algorithms were integrated.
Since in recent years commercial and non-commercial solvers for mixed integer linear programs or satisfiability problems became much more efficient, they may be a good alternative for calculating exact (or heuristic) solutions. Hence, we provided new sections on MIP-formulations and a SAT-formulation for the RCPSP. Furthermore, a description of ant colony optimization was added to the section on heuristic methods for solving the RCPSP. The section on lower bounds was augmented by bounds based on Lagrangian relaxation. In connection with the new methods for solving the RCPSP, basic concepts for SAT solvers, Lagrangian relaxation, and ant colony optimization have been added to Chapter 2. We also wrote a new basic section on constraint programming and corrected the input-or-output test.