Models and Algorithms of Time-Dependent Scheduling (2nd Ed., 2nd ed. 2020) Monographs in Theoretical Computer Science. An EATCS Series
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.
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
Date de parution : 07-2021
Ouvrage de 538 p.
15.5x23.5 cm
Date de parution : 06-2020
Ouvrage de 538 p.
15.5x23.5 cm