Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Scheduling Algorithms

  • Book
  • © 1995

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

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-x
    Download chapter PDF

  2. Classification of Scheduling Problems

    • Peter Brucker
    Pages 1-10

  3. Some Problems in Combinatorial Optimization

    • Peter Brucker
    Pages 11-36

  4. Computational Complexity

    • Peter Brucker
    Pages 37-59

  5. Single Machine Scheduling Problems

    • Peter Brucker
    Pages 60-99

  6. Parallel Machines

    • Peter Brucker
    Pages 100-142

  7. Shop Scheduling Problems

    • Peter Brucker
    Pages 143-224

  8. Due-Date Scheduling

    • Peter Brucker
    Pages 225-247

  9. Batching Problems

    • Peter Brucker
    Pages 248-253

  10. Changeover Times and Transportation Times

    • Peter Brucker
    Pages 254-263

  11. Multiprocessor Tasks

    • Peter Brucker
    Pages 264-283

  12. Multi-Purpose Machines

    • Peter Brucker
    Pages 284-307

  13. Back Matter

    Pages 308-326
    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 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.

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