| dc.creator |
Schaack, Christian |
|
| dc.creator |
Larson, Richard C., 1943- |
|
| dc.date |
2004-05-28T19:36:44Z |
|
| dc.date |
2004-05-28T19:36:44Z |
|
| dc.date |
1985-02 |
|
| dc.date.accessioned |
2013-10-09T02:39:25Z |
|
| dc.date.available |
2013-10-09T02:39:25Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5381 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
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 or exceeds a given priority-dependent cutoff number. A queued priority i customer enters service the instant there are fewer than the respective cutoff number of servers busy and all higher priority queues are empty. The principal result is the priority i waiting time mean, second moment, and distribution (in transforms). The analysis is extended to systems in which any subset of priority levels may overflow to some other system, rather than join infinite capacity queues. The paper concludes with illustrative computational results. |
|
| dc.format |
1598457 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 135-85 |
|
| dc.title |
An N Server Cutoff Multi-Priority Queue |
|
| dc.type |
Working Paper |
|