 Multi-server accumulating priority queues with heterogeneous serversNa Li and David A. Stanford European Journal of Operational Research, 2016, vol. 252, issue 3, 866-878 Abstract: In the present work, we develop a multi-class multi-server queuing model with heterogeneous servers under the accumulating priority queuing discipline, where customers accumulate priority credits as a linear function of their waiting time in the queue, at rates which are distinct to the class to which they belong. At a service completion instant, the customer with the greatest accumulated priority commences service. When the system has more than one idle server, the so-called r-dispatch policy is implemented to determine which of the idle servers is to be selected to serve a newly-arriving customer. We establish the waiting time distribution for each class of customers. We also present a conservation law for the mean waiting time in M/Mi/c systems, and study a cost function in relation to the conservation law to optimize the level of heterogeneity among the service times in M/Mi/2 systems. Numerical investigations through simulation are carried out to validate our model. Keywords: Queuing; Multi-class accumulating priority queue; Heterogeneous servers; Conservation law; Waiting time distributions (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:252:y:2016:i:3:p:866-878 DOI: 10.1016/j.ejor.2016.02.010 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.