Queueing Network with Moving Servers as a Model of Car Sharing Systems
We consider a queueing network with a finite number of nodes and servers moving between the nodes as a model of car sharing. The arrival process of customers to various nodes is defined by a marked Markovian arrival process. The customer that arrives at a certain node when there is no idle server (c...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
MDPI AG
2019-09-01
|
| Серии: | Mathematics |
| Предметы: | |
| Online-ссылка: | https://www.mdpi.com/2227-7390/7/9/825 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|