This is the third edition of the only monograph on time-dependent scheduling problems. The book presents the results of more than 45 years of research in this dynamically developing domain of modern scheduling.

This monograph is a comprehensive study of all main results concerning single, parallel and dedicated machine time-dependent scheduling problems. The previous two editions of the book focused on models of time-dependent job processing times, algorithms for solving time-dependent scheduling problems, and computational complexity issues. This edition, in addition to the above topics, discusses various proof methods and proof techniques used in time-dependent scheduling.

Topics and features:

·Detailed analysis of scheduling problems in which job processing times are functions of job starting times

·More than 450 proofs of time-dependent scheduling results

·More than 100 algorithms for time-dependent scheduling problems

·More than 150 examples illustrating the discussed results and algorithms

·Almost 50 figures and tables facilitating the understanding of the concepts discussed and results

The book is intended for researchers and Ph.D. students working in time-dependent scheduling. It is also suitable for researchers working on problem complexity, and approximation, heuristic, local search and metaheuristic algorithms for scheduling problems. While the book offers introductory material on algorithms, NP-completeness and scheduling, a familiarity with the basics of calculus, discrete mathematics and combinatorial optimization theory is expected.

Stanislaw Gawiejnowicz is affiliated with the Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland, where he is Full Professor and Head of the Algorithmics Research Unit.

Stanisław Gawiejnowicz is affiliated with the Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań, Poland, where he is Full Professor and Head of the Algorithmics Research Unit.