Scheduling Algorithms

  • Peter Brucker

Table of contents

  1. Front Matter
    Pages I-XII
  2. Peter Brucker
    Pages 1-10
  3. Peter Brucker
    Pages 37-60
  4. Peter Brucker
    Pages 61-106
  5. Peter Brucker
    Pages 107-154
  6. Peter Brucker
    Pages 155-239
  7. Peter Brucker
    Pages 241-263
  8. Peter Brucker
    Pages 265-278
  9. Peter Brucker
    Pages 279-288
  10. Peter Brucker
    Pages 289-312
  11. Peter Brucker
    Pages 313-341
  12. Back Matter
    Pages 343-367

About this book

Introduction

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 multipurpose machines are discussed. The method used to solve these problems are linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Complexity results for the different classes of deterministic scheduling problems are updated and summarized. Also the references are updated.

Keywords

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

Authors and affiliations

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

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-24804-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-662-12944-9
  • Online ISBN 978-3-540-24804-0
  • About this book