Table of contents

  1. Front Matter
    Pages i-xii
  2. Pages 107-154
  3. Pages 155-241
  4. Pages 243-265
  5. Pages 267-280
  6. Pages 293-316
  7. Pages 317-345
  8. Back Matter
    Pages 347-371

About this book


Besides scheduling problems for single and parallel machines and shop scheduling problems the book covers advanced models involving due-dates, sequence dependent changeover times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for different classes of deterministic scheduling problems are summerized.


Ablaufplanung Algorithmen Complexity Discrete Optimization Diskrete Optimierung Komplexität Scheduling algorithms classification combinatorial optimization linear optimization

Authors and affiliations

  • Peter Brucker
    • 1
  1. 1.Fachbereich Mathematik/InformatikUniversität OsnabrückOsnabrückGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Business and Economics
  • Print ISBN 978-3-540-69515-8
  • Online ISBN 978-3-540-69516-5
  • Buy this book on publisher's site