Haviv, Moshe (2015) The M/G/1 queueing model with preemptive random priorities. In: 8th International Conference on Performance Evaluation Methodologies and Tools.
![[thumbnail of 21277.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "21277.pdf")
PDF
21277.pdf
Download (117kB)
Abstract
For the M/G/1 model, we look into a preemptive priority scheme in which the priority level is decided by a lottery. Such a scheme has no effect on the mean waiting time in the non-preemptive case (in comparison with the First Come First Served (FCFS) regime, for example). This is not the case when p
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 10:26 |
| Last Modified: | 17 Apr 2026 18:59 |
| URI: | http://eprints.eai.eu/id/eprint/12723 |
Actions (login required)
- View Item