Scheduling Theory. Single-Stage Systems

AvV. Tanaev,W. Gordon

Häftad, Engelska, 2012

Del i serien Mathematics and Its Applications

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

556 kr

Övrigt

4 591 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2012-10-08
Mått:155 x 235 x 21 mm
Vikt:587 g
Format:Häftad
Språk:Engelska
Serie:Mathematics and Its Applications
Antal sidor:374
Förlag:Springer
ISBN:9789401045209

Utforska kategorier

Optimering inom Naturvetenskap och teknik
Systemvetenskap och AI inom Data och IT
Ledarskap och motivation inom Ekonomi och Ledarskap

Recensioner i media

' 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

Innehållsförteckning

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.

Mer från samma författare

Scheduling Theory

V. Tanaev, Yuri N. Sotskov, V.A. Strusevich

Inbunden, 1994

1 106 kr

Scheduling Theory

V. Tanaev, Yuri N. Sotskov, V.A. Strusevich

Häftad, 2012

1 106 kr

Scheduling Theory. Single-Stage Systems

Yakov M. Shafransky, W. Gordon, V. Tanaev

E-bok

2012

718 kr

Scheduling Theory

V.A. Strusevich, Yuri N. Sotskov, V. Tanaev

E-bok

2012

1 413 kr

Mer från samma serie

Elements of Topological Dynamics

J. de Vries

Inbunden, 1993

1 216 kr

Integral Transformations, Operational Calculus, and Generalized Functions

R.G. Buschman

Häftad, 2013

556 kr

Elements of Topological Dynamics

J. de Vries

Häftad, 2010

1 216 kr

P-adic Deterministic and Random Dynamics

Andrei Y. Khrennikov, Marcus Nilsson

Inbunden, 2004

1 106 kr

Pseudosolution of Linear Functional Equations

Alexander S. Mechenov

Häftad, 2005

556 kr

Probability Theory with Applications

Malempati M. Rao, Randall J. Swift

Inbunden, 2006

1 106 kr

Del 581

Non-Euclidean Geometries

András Prékopa, Emil Molnár

Inbunden, 2005

1 656 kr

Phase Portraits of Planar Quadratic Systems

John Reyn

Inbunden, 2007

1 656 kr

Differential Geometry of Frame Bundles

L.A. Cordero, C.T. Dodson, Manuel de León

Inbunden, 1988

556 kr

Del 48

Lattice-Ordered Groups

A.M. Glass, W.C. Holland

Inbunden, 1989

556 kr

Du kanske också är intresserad av

10% rabatt på allt

Adventskalender Ravensburger pussel 2026

Ravensburger

319 kr

Scheduling Theory. Single-Stage Systems

V. Tanaev, W. Gordon, Yakov M. Shafransky

Inbunden, 1994

556 kr

Scheduling Theory Single-Stage Systems

V. Tanaev, W. Gordon, Yakov M. Shafransky

4 591 kr

Scheduling Theory. Single-Stage Systems

Yakov M. Shafransky, W. Gordon, V. Tanaev

E-bok

2012

718 kr

Every Young Man's Companion. Containing. I. Rules and Directions for Reading and Writing English. ... XXIV. List of Many Things Necessary to Be Known

W. Gordon

Häftad, 2010

331 kr

Scheduling Theory

V. Tanaev, Yuri N. Sotskov, V.A. Strusevich

Inbunden, 1994

1 106 kr

Scheduling Theory

V. Tanaev, Yuri N. Sotskov, V.A. Strusevich

Häftad, 2012

1 106 kr

Scheduling Theory

V.A. Strusevich, Yuri N. Sotskov, V. Tanaev

E-bok

2012

1 413 kr

Every Young Man's Companion. Containing. I. Rules and Directions for Reading and Writing English. ... XXIV. List of Many Things Necessary to be Known The Sixth Edition, Corrected. With Large Additions, and Great Improvements

W Gordon

Inbunden, 2018

460 kr

Account of the Tournament at Eglinton

W Gordon, James Aikman

Inbunden, 2023

359 kr

Scheduling Theory. Single-Stage Systems

AvV. Tanaev,W. Gordon

Häftad, Engelska, 2012

Del i serien Mathematics and Its Applications

556 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

556 kr

Övrigt

4 591 kr

Beskrivning

Produktinformation

Utgivningsdatum:2012-10-08
Mått:155 x 235 x 21 mm
Vikt:587 g
Format:Häftad
Språk:Engelska
Serie:Mathematics and Its Applications
Antal sidor:374
Förlag:Springer
ISBN:9789401045209

Utforska kategorier

Optimering inom Naturvetenskap och teknik
Systemvetenskap och AI inom Data och IT
Ledarskap och motivation inom Ekonomi och Ledarskap

Recensioner i media

Innehållsförteckning

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.