+612 9045 4394
Scheduling Theory. Single-Stage Systems : MATHEMATICS AND ITS APPLICATIONS (KLUWER ) - Vyacheslav S. Tanaev

Scheduling Theory. Single-Stage Systems



Published: 31st May 1994
Ships: 7 to 10 business days
7 to 10 business days
RRP $344.99
or 4 easy payments of $59.69 with Learn more

Scheduling theory is an important branch of operations research. Problems studied within the framework of that theory have numerous applications in various fields of human activity. As an independent discipline scheduling theory appeared in the middle of the fifties, and has attracted the attention of researchers in many countries. In the Soviet Union, research in this direction has been mainly related to production scheduling, especially to the development of automated systems for production control. In 1975 Nauka ("Science") Publishers, Moscow, issued two books providing systematic descriptions of scheduling theory. The first one was the Russian translation of the classical book Theory of Scheduling by American mathematicians R. W. Conway, W. L. Maxwell and L. W. Miller. The other one was the book Introduction to Scheduling Theory by Soviet mathematicians V. S. Tanaev and V. V. Shkurba. These books well complement each other. Both. books well represent major results known by that time, contain an exhaustive bibliography on the subject. Thus, the books, as well as the Russian translation of Computer and Job-Shop Scheduling Theory edited by E. G. Coffman, Jr., (Nauka, 1984) have contributed to the development of scheduling theory in the Soviet Union. Many different models, the large number of new results make it difficult for the researchers who work in related fields to follow the fast development of scheduling theory and to master new methods and approaches quickly.

` These two volumes dedicated to the theory and complexity of scheduling problems are a valuable source of information to researchers and graduate students of operations research, management, and computer sciences. Readers with particular interests in production planning and flexible manufacturing are very well served by this fine set. ' Journal of Global Optimization, 7, 1995

Elements of Graph Theory and Computational Complexity of Algorithms
Sets, Orders, Graphs
Balanced 2-3-Trees
Polynomial Reducibility of Discrete Problems
Complexity of Algorithms
Bibliography and Review
Polynomially Solvable Problems
Deadline-Feasible Schedules
Single Machine
Maximal Cost
Single Machine
Total Cost
Identical Machines
Maximal Completion Time
Equal Processing Times
Identical Machines
Maximal Completion Time
Identical Machines
Due Dates
Equal Processing Times
Identical Machines
Maximal Lateness
Uniform and Unrelated Parallel Machines
Total and Maximal Cost
Bibliography and Review
Priority-Generating Functions
Ordered Sets of Jobs
Priority-Generating Functions
Elimination Conditions
Tree-like Order
Series-Parallel Order
General Case
Convergence Conditions
1-Priority-Generating Functions
Bibliography and Review
NP-Hard Problems
Reducibility of the Partition Problem
Reducibility of the 3-Partition Problem
Reducibility of the Vertex Covering Problem
Reducibility of the Clique Problem
Reducibility of the Linear Arrangement Problem
Bibliographic Notes
Approximation Algorithms
Additional References
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780792328537
ISBN-10: 0792328531
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 374
Published: 31st May 1994
Publisher: Springer
Country of Publication: NL
Dimensions (cm): 25.4 x 17.15  x 2.54
Weight (kg): 0.82