|
![]() |
|||
|
||||
OverviewThis text presents an 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. It is aimed at final-year undergraduates as well as Master and PhD 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. Full Product DetailsAuthor: K. Kogan , E. KhmelnitskyPublisher: Springer Imprint: Springer Edition: 2000 ed. Volume: 43 Dimensions: Width: 15.50cm , Height: 2.30cm , Length: 23.50cm Weight: 1.660kg ISBN: 9780792364863ISBN 10: 0792364864 Pages: 397 Publication Date: 31 October 2000 Audience: College/higher education , Professional and scholarly , Undergraduate , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: Out of print, replaced by POD ![]() We will order this item for you from a manufatured on demand supplier. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |