Scheduling Theory: Multi-Stage Systems: Mathematics and Its Applications, cartea 285
Autor V. Tanaev, Yuri N. Sotskov, V. A. Strusevichen Limba Engleză Hardback – 31 mai 1994
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 628.11 lei 43-57 zile | |
SPRINGER NETHERLANDS – 8 oct 2012 | 628.11 lei 43-57 zile | |
Hardback (1) | 634.13 lei 43-57 zile | |
SPRINGER NETHERLANDS – 31 mai 1994 | 634.13 lei 43-57 zile |
Din seria Mathematics and Its Applications
- Preț: 228.74 lei
- 18% Preț: 918.48 lei
- 15% Preț: 629.85 lei
- 15% Preț: 633.31 lei
- 15% Preț: 574.68 lei
- Preț: 383.06 lei
- 18% Preț: 928.14 lei
- 15% Preț: 570.05 lei
- 5% Preț: 636.42 lei
- 15% Preț: 639.84 lei
- 15% Preț: 629.99 lei
- 15% Preț: 587.53 lei
- Preț: 383.65 lei
- 15% Preț: 633.17 lei
- Preț: 374.75 lei
- Preț: 383.26 lei
- 15% Preț: 686.07 lei
- Preț: 379.88 lei
- Preț: 378.62 lei
- 15% Preț: 568.30 lei
- 15% Preț: 635.25 lei
- 15% Preț: 570.22 lei
- 20% Preț: 577.41 lei
- Preț: 384.22 lei
- 15% Preț: 584.65 lei
- 15% Preț: 577.51 lei
- 15% Preț: 633.17 lei
- 15% Preț: 630.48 lei
- Preț: 381.05 lei
- 15% Preț: 630.48 lei
- 15% Preț: 625.05 lei
- Preț: 378.41 lei
Preț: 634.13 lei
Preț vechi: 746.03 lei
-15% Nou
Puncte Express: 951
Preț estimativ în valută:
121.37€ • 126.50$ • 101.04£
121.37€ • 126.50$ • 101.04£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780792328544
ISBN-10: 079232854X
Pagini: 420
Ilustrații: VIII, 406 p.
Dimensiuni: 170 x 244 x 28 mm
Greutate: 0.76 kg
Ediția:1994
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
ISBN-10: 079232854X
Pagini: 420
Ilustrații: VIII, 406 p.
Dimensiuni: 170 x 244 x 28 mm
Greutate: 0.76 kg
Ediția:1994
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Mathematics and Its Applications
Locul publicării:Dordrecht, Netherlands
Public țintă
ResearchCuprins
1 Flow Shop.- 1. Maximal Completion Time. Two Machines.- 2. Maximal Completion Time. Three and More Machines.- 3. Maximal Completion Time with No-Wait in Process.- 4. Maximal Lateness.- 5. Total Flow Time.- 6. Ordered Matrices of Processing Times.- 7. Dominant Matrices of Processing Times.- 8. Approximation Algorithms.- 9. Bibliography and Review.- 2 Job Shop.- 1. Optimal Processing of Two Jobs.- 2. Maximal Lateness.- 3. Maximal Completion Time. Equal Processing Times.- 4. Maximal Completion Time. Arbitrary Processing Times.- 5. Maximal Completion Time with No-Wait in Process.- 6. Bibliography and Review.- 3 Open Shop.- 1. Maximal Completion Time. Two Machines.- 2. Maximal Completion Time. Three and More Machines.- 3. Maximal Completion Time. Preemption.- 4. Maximal Completion Time. Precedence Constraints.- 5. Due Dates.- 6. Total Flow Time. Equal Processing Times.- 7. Total Flow Time. Arbitrary Processing Times.- 8. Bibliography and Review.- 4 Mixed Graph Problems.- 1. Network Representation of Processing Systems.- 2. Mixed Graphs.- 3. Branch-and-Bound Method.- 4. Optimization of Processing Systems.- 5. Stability of Optimal Schedules.- 6. Bibliography and Review.- 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
`The book is well written. ... Therefore, the book can be recommended for readers working in the field of scheduling and related areas from different points of view.'
Optimization, 37, 1996
Journal of Global Optimization, 7, 1995
`The book is well written. ... Therefore, the book can be recommended for readers working in the field of scheduling and related areas from different points of view.'
Optimization, 37, 1996