Reviews
Description
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems arising in advanced planning and computer systems. In such systems jobs are supposed to be processed requiring resources, e.g. machines, tools, personnel, in such a way that certain objectives are met. There is a huge number of specific scheduling problems differing in a variety of parameters such as job importance, release times, due dates, processing times, precedence constraints, resource usage, etc. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches are presented. Efficient implementations of constraint programming approaches are discussed. The book covers a broad range of problems from single and parallel processors, flexible shops and flexible manufacturing systems to resource-constrained project scheduling.
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems arising in advanced planning and computer systems. In such systems jobs are supposed to be processed requiring resources, e.g. machines, tools, personnel, in such a way that certain objectives are met. There is a huge number of specific scheduling problems differing in a variety of parameters such as job importance, release times, due dates, processing times, precedence constraints, resource usage, etc. Polynomial and exponential time optimization algorithms as well as approximation and heuristic approaches are presented. Efficient implementations of constraint programming approaches are discussed. The book covers a broad range of problems from single and parallel processors, flexible shops and flexible manufacturing systems to resource-constrained project scheduling.
Reviews