Techniques for Scheduling Problems
We first introduce the scheduling models that are widely studied in the literature. For some of the NP-hard problems, we review the most efficient branch and bound algorithms, and comment on reasons for their success. We then discuss how local search is applied in scheduling, focusing on recent developments. Finally, we consider the design of efficient dynamic programming algorithms, with particular emphasis on scheduling problems in which jobs are processed in batches.