Scheduling and Control of Queueing Networks: Institute of Mathematical Statistics Textbooks, cartea 14
Autor Gideon Weissen Limba Engleză Paperback – 13 oct 2021
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 361.17 lei 6-8 săpt. | |
| Cambridge University Press – 13 oct 2021 | 361.17 lei 6-8 săpt. | |
| Hardback (1) | 798.62 lei 6-8 săpt. | |
| Cambridge University Press – 13 oct 2021 | 798.62 lei 6-8 săpt. |
Din seria Institute of Mathematical Statistics Textbooks
-
Preț: 257.54 lei -
Preț: 298.10 lei -
Preț: 320.72 lei -
Preț: 320.25 lei - 11%
Preț: 626.60 lei -
Preț: 322.41 lei -
Preț: 324.56 lei -
Preț: 319.22 lei -
Preț: 280.81 lei -
Preț: 321.63 lei -
Preț: 322.58 lei -
Preț: 357.31 lei -
Preț: 276.37 lei -
Preț: 322.16 lei -
Preț: 319.48 lei
Preț: 361.17 lei
Nou
Puncte Express: 542
Preț estimativ în valută:
63.90€ • 74.45$ • 55.80£
63.90€ • 74.45$ • 55.80£
Carte tipărită la comandă
Livrare economică 19 ianuarie-02 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781108401173
ISBN-10: 1108401171
Pagini: 200
Dimensiuni: 151 x 229 x 22 mm
Greutate: 0.59 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Institute of Mathematical Statistics Textbooks
Locul publicării:New York, United States
ISBN-10: 1108401171
Pagini: 200
Dimensiuni: 151 x 229 x 22 mm
Greutate: 0.59 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Institute of Mathematical Statistics Textbooks
Locul publicării:New York, United States
Cuprins
Notation; Introduction; Part I. The Single Queue: 1. Queues and their simulations, birth and death queues; 2. The M/G/1 queue; 3. Scheduling; Part II. Approximations of the Single Queue: 4. The G/G/1 queue; 5. The basic probability functional limit theorems; 6. Scaling of G/G/1 and G/G/∞; 7. Diffusions and Brownian processes; Part III. Queueing Networks: 8. Product form queueing networks; 9. Generalized Jackson networks; Part IV. Fluid Models of Multi-Class Queueing Networks: 10. Multi-class queueing networks, instability and Markov representations; 11. Stability of MCQN via fluid limits; 12. Processing networks and maximum pressure policies; 13. Processing networks with infinite virtual queues; 14. Optimal control of transient networks; Part V. Diffusion-Scaled Balanced Heavy Traffic: 15. Join the shortest queue in parallel servers; 16. Control in balanced heavy traffic; 17. MCQN with discretionary routing; Part VI. Many-Server Systems: 18. Infinite servers revisited; 19. Asymptotics under Halfin–Whitt regime; 20. Many servers with abandonment; 21. Load balancing in the supermarket model; 22. Parallel servers with skill-based routing; References; Index.
Notă biografică
Descriere
A graduate text on theory and methods using applied probability techniques for scheduling service, manufacturing, and information networks.