Queueing Systems with Moving Servers

Queueing Systems with Moving Servers

AngličtinaPevná väzbaTlač na objednávku
Belyaev Yuri
Taylor & Francis Ltd
EAN: 9781041089285
Tlač na objednávku
Predpokladané dodanie v utorok, 25. augusta 2026
165,48 €
ks
Chcete tento titul ešte dnes?
kníhkupectvo Megabooks Banská Bystrica
nie je dostupné
kníhkupectvo Megabooks Bratislava
nie je dostupné
kníhkupectvo Megabooks Košice
nie je dostupné

Podrobné informácie

Queuing theory methods are employed in managing traffic flows, shipping facilities, communication systems, vertical transportation, and others. The study of such systems is outside the framework of the methods of classical queuing theory; thus, new methodologies, such as systems with moving servers, have evolved. These systems are different and have complicated structures, but they have one common ideology, i.e. systems with moving servers. The book is dedicated to constructing and investigating mathematical models of queueing systems with moving servers.

It is meant for researchers who are working in the application of mathematical methods in various fields (traffic, communication systems, and others), mathematicians in the field of queueing systems, also researchers who are interested in the construction and investigation of mathematical models of queueing systems with moving servers. The theoretical results are demonstrated on numerical examples.

EAN 9781041089285
ISBN 1041089287
Typ produktu Pevná väzba
Vydavateľ Taylor & Francis Ltd
Dátum vydania 27. októbra 2025
Stránky 246
Jazyk English
Rozmery 234 x 156
Krajina United Kingdom
Autori Belyaev Yuri; Hajiyev Asaf
Ilustrácie 24 Tables, black and white; 11 Line drawings, color; 3 Line drawings, black and white; 11 Halftones, color; 48 Halftones, black and white; 22 Illustrations, color; 51 Illustrations, black and white
Informácie o výrobcovi
Kontaktné informácie výrobcu momentálne nie sú dostupné online, na náprave intenzívne pracujeme. Ak informáciu potrebujete, napíšte nám na [email protected], radi vám ju poskytneme.