Description

Book Synopsis

Scheduling theory is an important branch of operations research. 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.

Trade Review

` 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

Table of Contents

Preface. Introduction. 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. 1-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. Index.

Scheduling Theory SingleStage Systems 284 Mathematics and Its Applications

    Product form

    A Hardback by V. Tanaev, W. Gordon, Yakov M. Shafransky

    £999.99

    Includes FREE delivery

    Out of stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Scheduling Theory SingleStage Systems 284 Mathematics and Its Applications by V. Tanaev

      Book details

      Publisher Springer Nature
      Published 31 May 1994
      ISBN-13 9780792328537
      978-0792328537
      ISBN-10 0792328531

      Description

      Book Synopsis

      Scheduling theory is an important branch of operations research. 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.

      Trade Review

      ` 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

      Table of Contents

      Preface. Introduction. 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. 1-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. Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account