An N Server Cutoff Multi-Priority Queue
Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each lower priority are deliberately queued whenever the number of servers busy equals o...
| Principais autores: | , |
|---|---|
| Formato: | Working Paper |
| Idioma: | en_US |
| Publicado em: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Acesso em linha: | http://hdl.handle.net/1721.1/5381 |