|
 ABSTRACT
This paper deals with a single server serving N priority classes (N being finite or infinite) and working under an FBz regime, namely, one in which the waiting line consists of infinitely many separate queues obeying the FIFO rule. Each priority class is assigned to one of the queues. A customer from the kth priority class (“k-customer”) in the nth queue is eligible for &thgr;n,k time units of service, at the end of which he either departs, because his requirement is satisfied, or joins the tail of the (n + 1)-th queue. When a quantum of service is completed, the server turns to the first customer in the lowest index (highest priority) nonempty queue.
The arrival process of k-customers is assumed to be homogeneous Poisson, and their service requirements are independent, generally distributed, random variable. A set of recursive linear equations is derived for the expected flow time of a k-customer whose service requirement is known, and some examples are discussed and presented graphically.
This paper corrects some errors in an earlier paper by the second author.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
ADlm, I , AND AVa-ITznAZ, B A time-sharing model with many queues Oper Res 17, 6 (1969), 1077- 1089
|
| |
3
|
|
| |
4
|
CoNwAY, R.W., MAXWELL, W.L., AND MILLER, L.W Theory of Scheduhng Addison-Wesley, Reading, Mass., 1967
|
| |
5
|
LITTLe, J D.C A proof of the queuemg formula L = kW Oper Res. 9, 3 (1961), 383-387
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.3