Time-dependent scheduling (Q938826)

In the book under review, the author first introduces the basic concepts of scheduling and complexity theory. Then the central chapter treats single machine problems with time-dependent processing times (e.g. \(pj(t)=bj.t)\). A comprehensive complexity table is provided giving an overview of these single machine problems. Afterwards parallel machine problems and some dedicated time-dependent problems are presented. This theoretical parts treat mainly complexity results. Then some algorithmic approaches are developed -- mainly heuristics and near-optimal solutions (using e.g. local search). At the end of the book some adnvanced topics (like two-criterion problems) are summarized. All in all the book gives an deep overview for all kind of time-dependent scheduling problems with a central focus on complexity.