Scheduling Theory. Single-Stage Systems: Mathematics and Its Applications, cartea 284
Autor V. Tanaev, W. Gordon, Yakov M. Shafranskyen Limba Engleză Hardback – 31 mai 1994
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 385.44 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 8 oct 2012 | 385.44 lei 6-8 săpt. | |
Hardback (1) | 393.73 lei 6-8 săpt. | |
SPRINGER NETHERLANDS – 31 mai 1994 | 393.73 lei 6-8 săpt. |
Din seria Mathematics and Its Applications
- Preț: 228.74 lei
- 18% Preț: 926.46 lei
- 15% Preț: 635.31 lei
- 15% Preț: 638.82 lei
- 15% Preț: 579.67 lei
- Preț: 386.36 lei
- 18% Preț: 936.20 lei
- 15% Preț: 574.99 lei
- 5% Preț: 641.93 lei
- 15% Preț: 645.37 lei
- 15% Preț: 635.45 lei
- 15% Preț: 592.62 lei
- Preț: 386.95 lei
- 15% Preț: 638.66 lei
- Preț: 374.76 lei
- Preț: 386.57 lei
- 15% Preț: 692.01 lei
- Preț: 383.16 lei
- Preț: 381.87 lei
- 15% Preț: 573.24 lei
- 15% Preț: 640.75 lei
- 15% Preț: 575.18 lei
- 20% Preț: 577.42 lei
- Preț: 387.52 lei
- 15% Preț: 589.73 lei
- 15% Preț: 582.53 lei
- 15% Preț: 638.66 lei
- 15% Preț: 635.95 lei
- Preț: 384.33 lei
- 15% Preț: 635.95 lei
- 15% Preț: 630.46 lei
- Preț: 381.68 lei
Preț: 393.73 lei
Nou
Puncte Express: 591
Preț estimativ în valută:
75.36€ • 78.33$ • 62.42£
75.36€ • 78.33$ • 62.42£
Carte tipărită la comandă
Livrare economică 05-19 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792328537
ISBN-10: 0792328531
Pagini: 386
Ilustrații: VIII, 374 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.74 kg
Ediția:1994
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
ISBN-10: 0792328531
Pagini: 386
Ilustrații: VIII, 374 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.74 kg
Ediția:1994
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
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.
Recenzii
` 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
Journal of Global Optimization, 7, 1995