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.
“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)
![]() |
Ask a Question About this Product More... |
![]() |