On a modified M/M/$m$/$n$ queueing model
The classic M/M/$m$/$n$ queueing model is modified by allowing a given task to require up to $m$ servers to be performed. Moreover, the maximum time that a task can wait in the queue before being executed is a random variable having an exponential distribution. Both FIFO (First In, First Out) and pr...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2021-04-01
|
| coleção: | Computer Science Journal of Moldova |
| Assuntos: | |
| Acesso em linha: | http://www.math.md/files/csjm/v29-n1/v29-n1-(pp29-40).pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|