© 2020

Models and Algorithms of Time-Dependent Scheduling

  • Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started

  • Author includes numerous examples, figures and tables, and different classes of algorithms presented using pseudocode

  • Previous edition focused on computational complexity of time-dependent scheduling problems, this edition concentrates on models of time-dependent job processing times and algorithms for solving scheduling problems


Table of contents

  1. Front Matter
    Pages I-XXIV

    1. Front Matter
      Pages 1-1
    2. Stanisław Gawiejnowicz
      Pages 3-15
    3. Stanisław Gawiejnowicz
      Pages 17-34
    4. Stanisław Gawiejnowicz
      Pages 35-44

    1. Front Matter
      Pages 45-45
    2. Stanisław Gawiejnowicz
      Pages 47-63
    3. Stanisław Gawiejnowicz
      Pages 65-82
    4. Stanisław Gawiejnowicz
      Pages 83-109

    1. Front Matter
      Pages 111-111
    2. Stanisław Gawiejnowicz
      Pages 113-169
    3. Stanisław Gawiejnowicz
      Pages 171-176
    4. Stanisław Gawiejnowicz
      Pages 177-195

    1. Front Matter
      Pages 197-197
    2. Stanisław Gawiejnowicz
      Pages 199-217
    3. Stanisław Gawiejnowicz
      Pages 219-227
    4. Stanisław Gawiejnowicz
      Pages 229-236

    1. Front Matter
      Pages 237-237
    2. Stanisław Gawiejnowicz
      Pages 239-259
    3. Stanisław Gawiejnowicz
      Pages 261-278

About this book


This is a comprehensive study of various time-dependent scheduling problems 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, time-dependent scheduling with two criteria and time-dependent two-agent scheduling. 

The reader should be familiar with the basic notions of calculus, discrete mathematics and combinatorial optimization theory, while the book offers introductory material on theory of algorithms, 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, he completes all chapters with extensive bibliographies, and he closes the book with comprehensive symbol and subject indexes. 

The previous edition of the book focused on computational complexity of time-dependent scheduling problems. In this edition, the author concentrates on models of time-dependent job processing times and algorithms for solving time-dependent scheduling problems. The book is suitable for researchers working on scheduling, problem complexity, optimization, heuristics and local search algorithms.


Optimization Theory Algorithms Combinatorial Optimization Heuristics Scheduling Time-Dependent Scheduling

Authors and affiliations

  1. 1.Faculty of Mathematics and Computer ScienceAdam Mickiewicz University in PoznańPoznańPoland

Bibliographic information

  • Book Title Models and Algorithms of Time-Dependent Scheduling
  • Authors Stanisław Gawiejnowicz
  • Series Title Monographs in Theoretical Computer Science. An EATCS Series
  • Series Abbreviated Title Monographs Theoret.Computer Science(formerly:EATCS)
  • DOI
  • Copyright Information Springer-Verlag GmbH Germany, part of Springer Nature 2020
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Hardcover ISBN 978-3-662-59361-5
  • Softcover ISBN 978-3-662-59364-6
  • eBook ISBN 978-3-662-59362-2
  • Series ISSN 1431-2654
  • Series E-ISSN 2193-2069
  • Edition Number 2
  • Number of Pages XXIV, 538
  • Number of Illustrations 24 b/w illustrations, 0 illustrations in colour
  • Topics Theory of Computation
    Operations Research/Decision Theory
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking


“The book presents a lot of material for time dependent scheduling, it is full of algorithms (in pseudo-code) and of complexity proofs, it provides a deep insight to the theory and practice of scheduling.” (Helmut G. Kahlbacher, zbMATH 1453.90002, 2021)