Complex Scheduling
Reihentext: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 standar
- PDF / 3,666,822 Bytes
- 348 Pages / 439.37 x 666.14 pts Page_size
- 3 Downloads / 179 Views
r further volumes: http://www.springer.com/series/5257
Peter Brucker • Sigrid Knust
Complex Scheduling Second Edition
Prof. Dr. Peter Brucker Prof. Dr. Sigrid Knust Universität Osnabrück Fachbereich Mathematik/Informatik Albrechtstraße 28 49069 Osnabrück Germany [email protected] [email protected]
ISBN 978-3-642-23928-1 e-ISBN 978-3-642-23929-8 DOI 10.1007/978-3-642-23929-8 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011939194 © Springer-Verlag Berlin Heidelberg 2012 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Preface of the Second Edition In this revised 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. 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. Since in the first edition in the section on constraint propagation for the RCPSP the input-or-output test was incorrect, we corrected it in this edition. A list of errata according to the book can be found at the website http://www.informatik.uni-osnabrueck.de/knust/complex/
Osnabr¨ uck, August 2011
Peter Brucker, Sigrid Knust
v
Preface Scheduling problems have been investigated since the late fifties. Two types of applications have mainly motivated research in this area: project planning and machine scheduling. While in machin
Data Loading...
