Skip to main content

Waiting and Service Time of a Unique Customer in an M/M/m Preemptive LCFS Queue with Impatient Customers

  • Conference paper
  • First Online:
Queueing Theory and Network Applications (QTNA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10591))

Included in the following conference series:

  • 1112 Accesses

Abstract

We study an M/M/m preemptive last-come, first-served queue with impatient customers without priority classes. We focus on the probability of service completion and abandonment as well as the waiting and service times of a unique customer who has the mean service and patience times that are different from those of all other customers in the steady state. The problem is formulated as the first passage times in a combination of two one-dimensional birth-and-death processes each with two absorbing states. We provide explicit expressions in terms of Laplace-Stieltjes transform of the distribution function for the time to service completion or abandonment, which is decomposed into the waiting and service times of the unique customer. A numerical example is presented in order to demonstrate the computation of theoretical formulas.

This work is supported by the Grant-in-Aid for Scientific Research (C) No. 26330354 from the Japan Society for the Promotion of Science (JSPS) in the academic year 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Iravani, F., Balcıog̃lu, B.: On priority queues with impatient customers. Queueing Syst. 58(4), 239–260 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Takagi, H.: Times to service completion and abandonment in the M/M/\( m \) preemptive LCFS queue with impatient customers. In: QTNA 2016, Proceedings of the 11th International Conference on Queueing Theory and Network Applications, Article No. 2. ACM (2016). ISBN 978-1-4503-4842-3/16/12. https://dx.doi.org/10.1145/3016032.3016036

  3. Takagi, H.: Distribution of the waiting and service time in an M/M/\( m \) preemptive-resume LCFS queue with impatient customers. Int. J. Pure Appl. Math. 116(2), 501–545 (2017). https://dx.doi.org/10.12732/ijpam.v.116i2.21

  4. Wolff, R.W.: Stochastic Modeling and the Theory of Queues. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hideaki Takagi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Takagi, H. (2017). Waiting and Service Time of a Unique Customer in an M/M/m Preemptive LCFS Queue with Impatient Customers. In: Yue, W., Li, QL., Jin, S., Ma, Z. (eds) Queueing Theory and Network Applications. QTNA 2017. Lecture Notes in Computer Science(), vol 10591. Springer, Cham. https://doi.org/10.1007/978-3-319-68520-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68520-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68519-9

  • Online ISBN: 978-3-319-68520-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics