Scheduling in Computer and Manufacturing Systems

The book provides a theoretical and application orientedanalysis of deterministic scheduling problems arising incomputer and manufacturing environments. In such systemsprocessors (machines) and possibly other resources are to beallocated among tasks in such a way that certain schedulingobjectives are met. Various scheduling problems arediscussedwhere different problem parameters such as taskprocessing times, urgency weights, arrival times, deadlines, precedence constraints, and processor speed factors areinvolved. Most important classical results are surveyed, with particular attention paid to single-processorscheduling.Then more general models are studied, includingparallel processors, resource-constrained scheduling, flexible flow shops, dynamic job shops, andflexiblemanufacturing systems. For the presentation of algorithms aPascal-like notation is chosen and used in almost all cases.For the convenience of less advanced readers, basic conceptsfrom scheduling theory and related areas (e. g.computational complexity anlaysis) are included.