Scheduling Theory. Single-Stage Systems

1. Front Matter

   Pages i-viii

   PDF

2. Introduction

   • V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

   Pages 1-39

3. Elements of Graph Theory and Computational Complexity of Algorithms

   • V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

   Pages 40-68

4. Polynomially Solvable Problems

   • V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

   Pages 69-185

5. Priority-Generating Functions Ordered Sets of Jobs

   • V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

   Pages 186-252

6. NP-Hard Problems

   • V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

   Pages 253-311

7. Back Matter

   Pages 312-374

   PDF

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.

• Approximation
• Manufacturing
• algorithms
• complexity
• graphs
• operations research
• production
• scheduling

` 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

• Institute of Engineering Cybernetics, Byelorussian Academy of Sciences, Minsk, Byelorussia

  V. S. Tanaev, V. S. Gordon, Y. M. Shafransky

Policies and ethics