| Yazarlar (3) |
Prof. Dr. Oruç Raif ÖNVURAL
|
Hg Perros
|
|
U Koerner
|
| Özet |
| We consider a single server queue shared by N different classes of jobs. Class i jobs arrive at the queue in a Poisson fashion with a class dependent rate. The total number of class i jobs allowed to wait in the queue is wi, the window size of this class. A class i job that arrives to find wi class i jobs in the shared queue is forced to wait in an input queue. There is one input queue for each class. All classes receive the same service at the shared queue, which is exponentially distributed. We analyze the two-class model numerically. For more than two classes, we obtain an approximate decomposition algorithm that utilizes the two-class numerical procedure. Validation tests showed that the approximation procedure is fairly accurate. |
| Anahtar Kelimeler |
| Bildiri Türü | Tebliğ/Bildiri |
| Bildiri Alt Türü | Tam Metin Olarak Yayınlanan Tebliğ (Uluslararası Kongre/Sempozyum) |
| Bildiri Niteliği | Web of Science Kapsamındaki Kongre/Sempozyum |
| Bildiri Dili | İngilizce |
| Kongre Adı | |
| Kongre Tarihi | / |
| Basıldığı Ülke | |
| Basıldığı Şehir |
