Scheduling Algorithms

  • Peter Brucker

Table of contents

  1. Front Matter
    Pages i-x
  2. Peter Brucker
    Pages 1-10
  3. Peter Brucker
    Pages 37-59
  4. Peter Brucker
    Pages 60-99
  5. Peter Brucker
    Pages 100-142
  6. Peter Brucker
    Pages 143-224
  7. Peter Brucker
    Pages 225-247
  8. Peter Brucker
    Pages 248-253
  9. Peter Brucker
    Pages 254-263
  10. Peter Brucker
    Pages 264-283
  11. Peter Brucker
    Pages 284-307
  12. Back Matter
    Pages 308-326

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 change over times and batching. Also multiprocessor task scheduling and problems with multi-purpose machines are discussed. The methods used to solve these problems are polynomial algorithms, dynamic programming procedures, branch-and-bound algorithms and local search heuristics. Also complexity issues are addressed.


Ablaufplanung Algorithmen Diskrete Optimierung Komplexität algorithms combinatorial optimization complexity discrete optimization optimization programming scheduling

Authors and affiliations

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

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1995
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-662-03090-5
  • Online ISBN 978-3-662-03088-2
  • Buy this book on publisher's site