Skip to main content

A Dynamic Non-preemptive Priority Queueing Model with Two Types of Customers

  • 514 Accesses

Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS,volume 253)

Abstract

In this paper, we study a single-server non-preemptive priority queueing model with two types of customers. The customers arrive according to two independent Poisson processes, and the service times are exponential with possibly different parameters. While Type 1 customers, who have non-preemptive priority over Type 2 customers, have a finite waiting room, Type 2 customers have no such restriction. A new dynamic rule based on a predetermined threshold is applied in offering services to lower-priority customers (when higher-priority customers are present) whenever the server becomes free. Using matrix-analytic methods, we analyze the model in steady state and bring out some qualitative and interesting aspects of the model under study. We also compare our model to the classical two-customer non-preemptive priority model to show a marked improvement in the quality of service to customers under the proposed threshold model.

Keywords

  • Queueing
  • Dynamic non-preemptive priority
  • Matrix-analytic method
  • Algorithmic probability

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-981-13-2095-8_3
  • Chapter length: 20 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   139.00
Price excludes VAT (USA)
  • ISBN: 978-981-13-2095-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   179.99
Price excludes VAT (USA)
Hardcover Book
USD   179.99
Price excludes VAT (USA)
Fig. 1

References

  1. Adiri, I., Domb, I.: A single server queueing system working under mixed priority disciplines. Oper. Res. 30, 97–115 (1982)

    MathSciNet  CrossRef  Google Scholar 

  2. Avi-Itzhak, B., Brosh, I., Naor, P.: On discretionary priority queueing. Z. Angew. Math. Mech. 6, 235–242 (1964)

    MathSciNet  CrossRef  Google Scholar 

  3. Cho, Y.Z., Un, C.K.: Analysis of the M/G/1 queue under acombined preemptive/nonpreemptive priority discipline. IEEE Trans. Commun. 41, 132–141 (1993)

    CrossRef  Google Scholar 

  4. Conway, R.W., Maxwell, W., Miller, L.: Theory of Scheduling. Addison-Wesley, Reading, MA (1967)

    MATH  Google Scholar 

  5. Drekic, S., Stanford, D.A.: Threshold-based interventions to optimize performance in preemptive priority queues. Queueing Syst.35, 289–315 (2000)

    Google Scholar 

  6. Drekic, S., Stanford, D.A.: Reducing delay in preemptive repeat priority queues. Oper. Res. 49, 145–156 (2000)

    MathSciNet  CrossRef  Google Scholar 

  7. Jaiswal, N.K.: Priority queues. Acadameic Press, USA (1968)

    Google Scholar 

  8. Kim, K.: \((N, n)\)-preemptive priority queue. Perform. Eval. 68, 575–585 (2011)

    CrossRef  Google Scholar 

  9. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM (1999)

    Google Scholar 

  10. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore, MD. [1994 version is Dover Edition] (1981)

    Google Scholar 

  11. Neuts, M.F.: Algorithmic Probability: A Collection of Problems. Chapman and Hall, NY (1995)

    MATH  Google Scholar 

  12. Paterok, M., Ettl, A.: Sojourn time and waiting time distributions for M/G/1 queues with preemption-distance priorities. Oper. Res. 42, 1146–1161 (1994)

    MathSciNet  CrossRef  Google Scholar 

  13. Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton, NJ (1994)

    MATH  Google Scholar 

  14. Takagi, H.: Analysis of Polling Systems. MIT, USA (1986)

    Google Scholar 

  15. Takagi, H.: Queueing Analysis 1: A Foundation of Performance Evaluation: Vacation and Priority Systems. North-Holland, Amsterdam (1991)

    MATH  Google Scholar 

  16. Takagi, H., Kodera, Y.: Analysis of preemptive loss priority queues with preemption distance. Queueing Syst. 22, 367–381 (1996)

    MathSciNet  CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Srinivas R. Chakravarthy .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Chakravarthy, S.R. (2018). A Dynamic Non-preemptive Priority Queueing Model with Two Types of Customers. In: Ghosh, D., Giri, D., Mohapatra, R., Sakurai, K., Savas, E., Som, T. (eds) Mathematics and Computing. ICMC 2018. Springer Proceedings in Mathematics & Statistics, vol 253. Springer, Singapore. https://doi.org/10.1007/978-981-13-2095-8_3

Download citation