Two-class M/G/1 queue under workload control
In this paper, we consider a queueing system under the D-policy in which there are two classes of customers. Class-1 customers have a non-preemptive priority over class-2 customers. The idle server begins to serve the customers only when the total workload of the waiting customers (regardless of the...
محفوظ في:
| المؤلفون الرئيسيون: | , , , |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
2013
|
| الوصول للمادة أونلاين: | https://hdl.handle.net/10356/97101 http://hdl.handle.net/10220/10391 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Nanyang Technological University |
| اللغة: | English |
| الملخص: | In this paper, we consider a queueing system under the D-policy in which there are two classes of customers. Class-1 customers have a non-preemptive priority over class-2 customers. The idle server begins to serve the customers only when the total workload of the waiting customers (regardless of their classes) exceeds D. We derive the Laplace-Stieltjes transform of the waiting time of each class of customers. We then derive the mean waiting times. Lastly, we compare our analytical results with the simulation estimates for verification purposes. |
|---|