Models and Algorithms of Time-Dependent Scheduling

This book provides a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine environments. This is the first monograph on time-dependent scheduling.

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 ofthe 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.

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

Inhalt
Part I, Fundamentals.- Fundamentals.- Preliminaries.- Problems and Algorithms.- NP-Complete Problems.- Part II, Scheduling Models.- The Classical Scheduling Theory.- The Modern Scheduling Theory.- The Time-Dependent Scheduling.- Part III, Polynomial Problems.- Polynomial Single Machine Problems.- Polynomial Parallel Machine Problems.- Polynomial Dedicated Machine Problems.- Part IV, NP-Hard Problems.- NP-Hard Single Machine Problems.- NP-Hard Parallel Machine Problems.- NP-Hard Dedicated Machine Problems.- Part V, Algorithms.- Exact Algorithms.- Approximation Algorithms and Schemes.- Greedy Algorithms Based on Signatures.- Heuristic Algorithms.- Local Search and Meta-heuristic Algorithms.- Part VI, Advanced Topics.- Time-Dependent Scheduling Under Precedence Constraints.- Matrix Methods in Time-Dependent Scheduling.- Bi-criteria Time-Dependent Scheduling.- New Topics in Time-Dependent Scheduling.- App. A, Open Time-Dependent Scheduling Problems.- List of Algorithms.- List of Figures.- List of Tables.- Symbol Index.- Subject Index.