This Second Edition continues to provide comprehensive coverage of sequencing and scheduling techniques and features new research and emerging topics in areas that are crucial to the development of scheduling. With balanced coverage of deterministic methods and stochastic and safe scheduling, the authors present a coherent and detailed introduction to the basic problems, models, and methods of scheduling theory. Chapters 1-7 provide an introduction and overview of sequencing and scheduling, including single-machine sequencing, optimization and heuristics methods for the single-machine problem, and earliness and tardiness penalties. In addition, the authors discuss the application of generic optimization software to basic sequencing problems and the use of spreadsheet-based optimization methods. Coverage also reflects the recent increased attention on robust scheduling and the safe scheduling framework. In light of these trends, robust scheduling is incorporated as appropriate, and the treatment of Risk SolverTM has been updated to reflect the most recent software changes. Chapter 8 provides a detailed treatment of the most prominent extensions of the basic model and features new coverage on models that incorporate job selection as well as models with multiple agents. Current results on flow shop sequencing are provided as well as PERT21 and the lognormal model for processing times in a stochastic environment. Topical coverage includes: introduction; single-machine sequencing; optimization methods for the single-machine problem; heuristic methods for the single-machine problem; earliness and tardiness costs; sequencing for stochastic scheduling; safe scheduling; extensions of the basic model; parallel-machine models; flow shop scheduling; stochastic flow shop scheduling; lot streaming procedures for the flow shop; scheduling groups of jobs; the job shop problem; simulation models for the dynamic job shop; network methods for project scheduling; resource-constrained project scheduling; and safe scheduling for projects.