A theoretical and application-oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. The important classical results are surveyed with particular attention paid to single-processor scheduling, along with general models such as resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. Polynomial and exponential-time optimization algorithms as well as approximation and heuristic ones are presented using a Pascal-like notation, before being discussed in the light of particular problems. Basic concepts from scheduling theory and related fields are described to assist less advanced readers.