|
|||||
|
|
Waiting times in queues with relative priorities |
|
| Authors: | Moshe Haviv Jan van der Wal |
| Institution: | a Department of Statistics, The Hebrew University of Jerusalem, 91905 Jerusalem, Israel b Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands c Faculty of Economics and Business, University of Amsterdam, Amsterdam, The Netherlands |
| Abstract: | This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. |
| Keywords: | Non-preemptive relative priorities _method=retrieve& _eid=1-s2 0-S0167637706001180& _mathId=si3 gif& _pii=S0167637706001180& _issn=01676377& _acct=C000051805& _version=1& _userid=1154080& md5=4d95a618166807c6d523d5984a2fde35')" style="cursor:pointer M|G|1 queues" target="_blank">" alt="Click to view the MathML source" title="Click to view the MathML source">M|G|1 queues |
| 本文献已被 ScienceDirect 等数据库收录！ | |