control-based theory and polynomial-time algorithms
Edición de la obra Scheduling
| Autor | Konstantin Kogan |
|---|---|
| Editorial | Kluwer Academic Publishers |
| Fecha de publicación | 2000 |
| Lugar | Dordrecht, Boston |
| Idioma | inglés |
| Páginas | 394 |
| ISBN-10 | 0792364864 |
| OCLC | 44313467 |
| LCCN | 00044383 |
| Serie | Applied optimization -- v. 43 · Applied optimization -- vol. 43. |
| Número de Cutter | K78s |
This book presents the first attempt to systematically collect, classify, and solve various scheduling problems which could not be solved solely by combinatorics and mathematical programming. Although control and combinatorics are generally regarded as belonging to totally different areas of research and application, this book suggests a methodology for integrating them in a unique solution approach which draws upon the advantages of both mathematical tools. In this book, the reader will find a great number of fast, easy-to-implement algorithms for various production environments which current scheduling literature has not covered. Audience: This book is aimed at final-year undergraduates as well as Master and Ph.D. students, primarily in operations research, management, industrial engineering, and control systems. The book is also useful for practising engineers interested in planning, scheduling, and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed in the book can be embedded very efficiently in large applications.