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: | , |
---|---|
Format: | Working Paper |
Language: | en_US |
Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/5320 |