Scheduling Algorithms

Más información sobre el libro

The book delves into complex scheduling issues, addressing both single and parallel machine scenarios, alongside advanced models that incorporate due-dates, sequence-dependent changeover times, and batching. It explores multiprocessor task scheduling and multi-purpose machines, employing various solution methods such as linear programming, dynamic programming, branch-and-bound algorithms, and local search heuristics. Additionally, it summarizes complexity results for various deterministic scheduling problem classes, providing a comprehensive overview of the field.