Scheduling Theory. Single-Stage Systems
V. S. Tanaev · 1994
Where to buy
Amazon’s price changes daily, so the most accurate place to see it is there, at the moment you buy.
View on AmazonThis is an affiliate link: if you buy through it, the site earns a small commission at no extra cost to you, which helps us bring quality content and maintain the site. As an Amazon Associate we earn from qualifying purchases.
About the book
This is one of two volumes devoted to single and multistage systems in scheduling theory respectively. The main emphasis throughout is on the analysis of the computational complexity of scheduling problems. <br/> This volume is devoted to the problems of determining optimal schedules for systems consisting of either a single machine or several parallel machines. The most important statements and algorithms which relate to scheduling are described and discussed in detail. The book has an introduction followed by four chapters dealing with the elements of graph theory and the computational complexity of algorithms, polynomially solvable problems, priority-generating functions, and <em>NP</em>-Hard problems, respectively. Each chapter concludes with a comprehensive biobliography and review. The volume also includes an appendix devoted to approximation algorithms and extensive reference sections. <br/> For researchers and graduate students of management science and operations research interested in production planning and flexible manufacturing. <br/>
Book details
- Year
- 1994
- Language
- English
- Series
- Mathematics and Its Applications -- 284
- Publisher
- Springer Netherlands
- Editions
- 1
- Pages
- 388
- ISBN
- 9789401111904
Data source: Wikidata
