Models and Simulations of Queueing Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14560%2F17%3A00097758" target="_blank" >RIV/00216224:14560/17:00097758 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-319-58088-3_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-58088-3_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-58088-3_2" target="_blank" >10.1007/978-3-319-58088-3_2</a>
Alternative languages
Result language
angličtina
Original language name
Models and Simulations of Queueing Systems
Original language description
In the queueing theory, it is assumed that requirement arrivals correspond to the Poisson process and the service time has the exponential distribution. Using these assumptions, the behaviour of the queueing system can be described by means of the Markov chains and it is possible to derive characteristics of the system. In the paper, these theoretical approaches are presented and focused on systems with several service lines and the FIFO queue when the number of requirements exceeds the number of lines. Finally, it is also shown how to compute the characteristics in a situation when these assumptions are not satisfied.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
50203 - Industrial relations
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Advances in Intelligent Systems and Computing
ISBN
9783319580876
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
16-25
Publisher name
Springer
Place of publication
Berlin
Event location
Brno
Event date
Jan 1, 2016
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—