Models and Simulations of Queueing Systems
| Authors | |
|---|---|
| Year of publication | 2017 |
| Type | Article in Proceedings |
| Conference | Advances in Intelligent Systems and Computing |
| MU Faculty or unit | |
| Citation | |
| Web | Models and Simulations of Queueing Systems |
| Doi | http://dx.doi.org/10.1007/978-3-319-58088-3_2 |
| Field | Other mechanical engineering |
| Keywords | Queue; Markovian chain |
| 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. |