Timedependent scheduling involves problems in which the processing times ofjobs depend on when those jobs are started. This book is a comprehensive studyof comp... » 

Timedependent scheduling involves problems in which the processing times ofjobs depend on when those jobs are started. This book is a comprehensive studyof complexity results and optimal and suboptimal algorithms concerning timedependent scheduling in single parallel and dedicatedmachine environments.In addition to complexity issues and exact or heuristic algorithms which aretypically presented in scheduling books the author also includes more advancedtopics such as matrix methods in timedependent scheduling and timedependentscheduling with two criteria. The reader should be familiar with basic notionsof calculus discrete mathematics and combinatorial optimization theory whilethe book offers introductory material on NPcomplete problems and the basicsof scheduling theory. The author includes numerous examples figures andtables he presents different classes of algorithms using pseudocode and hecompletes the book with an extensive bibliography and author symbol andsubject indexes. The book is suitable for researchers working on schedulingproblem complexity optimization heuristics and local search algorithms. «