Advertisement

Time-Dependent Scheduling

  • Stanisław Gawiejnowicz

Part of the Monographs in Theoretical Computer Science book series (EATCS)

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Fundamentals

    1. Front Matter
      Pages 1-1
    2. Stanislaw Gawiejnowicz
      Pages 1-13
    3. Stanislaw Gawiejnowicz
      Pages 15-26
    4. Stanislaw Gawiejnowicz
      Pages 27-33
    5. Stanislaw Gawiejnowicz
      Pages 35-46
    6. Stanislaw Gawiejnowicz
      Pages 47-56
  3. Complexity

    1. Front Matter
      Pages 57-57
    2. Stanislaw Gawiejnowicz
      Pages 59-153
    3. Stanislaw Gawiejnowicz
      Pages 155-169
    4. Stanislaw Gawiejnowicz
      Pages 171-200
  4. Algorithms

    1. Front Matter
      Pages 201-201
    2. Stanislaw Gawiejnowicz
      Pages 203-244
    3. Stanislaw Gawiejnowicz
      Pages 245-265
    4. Stanislaw Gawiejnowicz
      Pages 267-282
  5. Advanced Topics

    1. Front Matter
      Pages 283-283
    2. Stanislaw Gawiejnowicz
      Pages 285-298
    3. Stanislaw Gawiejnowicz
      Pages 299-319
    4. Stanislaw Gawiejnowicz
      Pages 321-337
  6. Back Matter
    Pages 339-379

About this book

Introduction

Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix methods in time-dependent scheduling, and time-dependent scheduling with two criteria.

The reader should be familiar with basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on NP-complete problems, and the basics of scheduling theory. The author includes numerous examples, figures and tables, he presents different classes of algorithms using pseudocode, and he completes the book with an extensive bibliography, and author, symbol and subject indexes.

The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.

Keywords

Optimization Theory algorithm algorithms combinatorial optimization complexity heuristics optimization scheduling tar

Authors and affiliations

  • Stanisław Gawiejnowicz
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz UniversityPoland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-69446-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-69445-8
  • Online ISBN 978-3-540-69446-5
  • Series Print ISSN 1431-2654
  • Buy this book on publisher's site