Cover Image
Read Now

Scheduling Theory. Single-Stage Systems

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...

Full description

Bibliographic Details
Main Authors: Tanaev, V., Gordon, W. (Author), Shafransky, Yakov M. (Author)
Format: eBook
Language:English
Published: Dordrecht Springer Netherlands 1994, 1994
Edition:1st ed. 1994
Series:Mathematics and Its Applications
Subjects:
Operations Management
Operations Research
Computer Science
Production Management
Calculus Of Variations And Optimization
Theory Of Computation
Mathematical Optimization
Operations Research And Decision Theory
Calculus Of Variations
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • 1 Elements of Graph Theory and Computational Complexity of Algorithms
  • 1. Sets, Orders, Graphs
  • 2. Balanced 2-3-Trees
  • 3. Polynomial Reducibility of Discrete Problems. Complexity of Algorithms
  • 4. Bibliography and Review
  • 2 Polynomially Solvable Problems
  • 1. Preemption
  • 2. Deadline-Feasible Schedules
  • 3. Single Machine. Maximal Cost
  • 4. Single Machine. Total Cost
  • 5. Identical Machines. Maximal Completion Time. Equal Processing Times
  • 6. Identical Machines. Maximal Completion Time. Preemption
  • 7. Identical Machines. Due Dates. Equal Processing Times
  • 8. Identical Machines. Maximal Lateness.
  • 9. Uniform and Unrelated Parallel Machines. Total and Maximal Cost
  • 10. Bibliography and Review
  • 3 Priority-Generating Functions. Ordered Sets of Jobs
  • 1. Priority-Generating Functions
  • 2. Elimination Conditions
  • 3. Tree-like Order
  • 4. Series-Parallel Order
  • 5. General Case
  • 6. Convergence Conditions
  • 7. l-Priority-Generating Functions
  • 8. Bibliography and Review
  • 4 NP-Hard Problems
  • 1. Reducibility of the Partition Problem
  • 2. Reducibility of the 3-Partition Problem
  • 3. Reducibility of the Vertex Covering Problem
  • 4. Reducibility of the Clique Problem
  • 5. Reducibility of the Linear Arrangement Problem
  • 6. Bibliographic Notes
  • Appendix Approximation Algorithms
  • References
  • Additional References
  • Also of Interest

Similar Items