Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-05T22:34:00.304Z Has data issue: false hasContentIssue false
  • English
  • Français

A preemptive priority queue with a general bulk service rule

Published online by Cambridge University Press:  17 April 2009

R. Sivasamy
R. Sivasamy
Affiliation:
Lecturer in Statistics, Annamalai University, Annamalai Nagar – 608 002, Tamil Nadu, India.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper a single server preemptive priority queueing system, consisting of two types of units, with unlimited Poisson inputs and exponential service time distributions, is studied. The higher priority units are served in batches according to a general bulk service rule and they have preemptive priority over lower priority units. Steady state queue length distributions, stability condition and the mean queue lengths are obtained.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 33 , Issue 2 , April 1986 , pp. 237 - 243
Copyright
Copyright © Australian Mathematical Society 1986

References

[1]Gohain, R. and Borthakur, A., “On difference equation technique applied to bulk service queue with one server”, Pure Appl. Math. Sci. 10 (1979), 63–69.Google Scholar
[2]Heathcote, C.R., “The time dependent problem for a queue with preemptive priorities”, Oper. Res. 7 (1959), 670–680.CrossRefGoogle Scholar
[3]Medhi, J., “Waiting time distribution in a poisson queue with general bulk service rule”, Management Sci. 21 (1975), 777–782.CrossRefGoogle Scholar
[4]Sivasamy, R., “A non preemptive priority queueing model with thresholds for the acceptance of non-priority units into service”, Pure Appl. Math. Sci. (to appear).Google Scholar