Scheduling: Control-Based Theory and Polynomial-Time Algorithms: 43 (Applied Optimization, 43) - Hardcover

Kogan, K.; Khmelnitsky, E.

Hardcover

ISBN 10: 0792364864 ISBN 13: 9780792364863

Publisher: Springer, 2000

Synopsis

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. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing 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 here can be embedded very efficiently in large applications.

About this title

Product Description

Scheduling Attempts to systematically collect, classify, and solve various scheduling problems which could not be solved solely by combinatorics and mathematical programming. Addressing the theory and design of computer-based scheduling algorithms, this book is aimed at final-year undergraduates as well as Master and PhD students.

Synopsis

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.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.

Edition details

• Publisher: Springer
• Publication date: 2000
• ISBN 10: 0792364864
• ISBN 13: 9780792364863
• Binding: Hardcover
• Language: English
• Number of pages: 407