An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to save available servers for higher priority customers, arriving customers of each...
| Main Authors: | , |
|---|---|
| 格式: | Working Paper |
| 语言: | en_US |
| 出版: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| 主题: | |
| 在线阅读: | http://hdl.handle.net/1721.1/5320 |