Scheduling: Control-based theory and polynomial-time algorithms (Q5948297)

This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools -- optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. Seven consecutive chapters describe in full detail the approach proposed. They are as follows: (1) Introduction to control-based scheduling. (2) Mathematical background. (3) Unlimited capacity problems. (4) Limited capacity problems. (5) One-machine problems. (6) Parallel machine problems. (7) Serial machine problems. The book indeed presents a novel approach to scheduling and this is its main advantage. The drawback is a complete lack of references to the papers dealing with the subject. Are all the presented results obtained by the authors?