Scheduling
control-based theory and polynomial-time algorithms
Our rough guess is there are 98,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 34 minutes to read. With a half hour per day, this will take 13 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Contributions
- Khmelnitsky, Eugene. - Contributor
Publication
2000 - Kluwer Academic Publishers, Dordrecht
Language
English
Word Count
98,500 words, Guess
Page Count
394 pages
Identifiers
- Open LibraryOL18321559M
- ISBN-100792364864
- OCLC Control Number44313467
- Library of Congress Control Number00044383
- Goodreads5923766
Classifications
- DDC658.5/3
- LCCTS157.5 .K57 2000
Description
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.
Subjects
Topics
Series Statement
- Applied optimization -- v. 43
Other Editions
- Scheduling
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!