Skip to main content
SpringerLink
Log in

Scheduling Algorithms

  • Book
  • © 1998

Overview

Authors:
  1. Peter Brucker

    1. Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • The book presents: algorithms for classical and complex scheduling problems

  • new results on scheduling problems arising in flexible manufacturing

  • an extensive overview of the area of scheduling

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. Classification of Scheduling Problems

    • Peter Brucker
    Pages 1-10

  3. Some Problems in Combinatorial Optimization

    • Peter Brucker
    Pages 11-35

  4. Computational Complexity

    • Peter Brucker
    Pages 36-60

  5. Single Machine Scheduling Problems

    • Peter Brucker
    Pages 61-100

  6. Parallel Machines

    • Peter Brucker
    Pages 101-144

  7. Shop Scheduling Problems

    • Peter Brucker
    Pages 145-228

  8. Due-Date Scheduling

    • Peter Brucker
    Pages 229-251

  9. Batching Problems

    • Peter Brucker
    Pages 252-263

  10. Changeover Times and Transportation Times

    • Peter Brucker
    Pages 264-273

  11. Multi-Purpose Machines

    • Peter Brucker
    Pages 274-297

  12. Multiprocessor Tasks

    • Peter Brucker
    Pages 298-320

  13. Back Matter

    Pages 321-342
    Download chapter PDF
Back to top

Keywords

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 multipurpose 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 the different classes of deterministic scheduling problems are summarized.

Authors and Affiliations

  • Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany

    Peter Brucker

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation