haku: @author Larson, R. C. / yhteensä: 11
viite: 4 / 11
| Tekijä: | Schaack, C. Larson, R. C. |
| Otsikko: | An N server cutoff priority queue where arriving customers request a random number of servers. |
| Lehti: | Management Science
1989 : MAY, VOL. 35:5, p. 614-634 |
| Asiasana: | QUEUING THEORY |
| Kieli: | eng |
| Tiivistelmä: | Considered is a multi-priority, N-server Poisson arrival, nonpreemptive queue, motivated by police applications. The number of servers requested by any arrival has a known priority dependent probability distribution. All servers requested by a customer must start service simultaneously; the servers' service times are independent and exponentially distributed. 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. |
SCIMA