Scheduling in Computer and Manufacturing Systems

The book provides a theoretical and application oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. In such systems processors (machines) and possibly other resources are to be allocated among tasks in such a way that certain scheduling objectives are met. Various scheduling problems are discussedwhere different problem parameters such as task processing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factors are involved. Most important classical results are surveyed, with particular attention paid to single-processor scheduling.Then more general models are studied, including parallel processors, resource-constrained scheduling, flexible flow shops, dynamic job shops, andflexible manufacturing systems. For the presentation of algorithms a Pascal-like notation is chosen and used in almost all cases. For the convenience of less advanced readers, basic concepts from scheduling theory and related areas (e. g. computational complexity anlaysis) are included.