Skip to main content
SpringerLink
Log in

Optimization of Service Rate in a Discrete-Time Impatient Customer Queue Using Particle Swarm Optimization

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9581))

  • 771 Accesses

Abstract

This paper investigates a discrete-time balking, reneging queue with Bernoulli-schedule vacation interruption. Particle swarm optimization which is a biologically inspired optimization technique mimicking the behavior of birds flocking or fish schooling is implemented to determine the optimum service rate that minimizes the total expected cost function per unit time. A potential application of the considered queueing problem in an inbound email contact center is also presented.

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

Access this chapter

Log in via an institution
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. Goswami, V.: A discrete-time queue with balking, reneging and working vacations. Int. J. Stoch. Anal. 2014, 8 p. (2014). Article ID 358529, http://dx.doi.org/10.1155/2014/358529

  2. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Canberra, Australia, vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  3. Rao, S.S.: Engineering Optimization: Theory and Practice. Wiley, New Jersey (2009)

    Book  Google Scholar 

  4. Vijaya Laxmi, P., Goswami, V., Jyothsna, K.: Analysis of discrete-time single server queue with balking and multiple working vacations. Qual. Tech. Quan. Manage. Int. J. 10(4), 443–456 (2013)

    Google Scholar 

  5. Vijaya Laxmi, P., Jyothsna, K.: Impatient customer queue with Bernoulli schedule vacation interruption. Comput. Oper. Res. 56, 1–7 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Andhra University, Visakhapatnam, 530003, India

    Pikkala Vijaya Laxmi & Kanithi Jyothsna

Authors
  1. Pikkala Vijaya Laxmi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kanithi Jyothsna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pikkala Vijaya Laxmi .

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, Washington, USA

    Nikolaj Bjørner

  2. Indian Institute of Technology Delhi, New Delhi, India

    Sanjiva Prasad

  3. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA

    Laxmi Parida

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Laxmi, P.V., Jyothsna, K. (2016). Optimization of Service Rate in a Discrete-Time Impatient Customer Queue Using Particle Swarm Optimization. In: Bjørner, N., Prasad, S., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2016. Lecture Notes in Computer Science(), vol 9581. Springer, Cham. https://doi.org/10.1007/978-3-319-28034-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28034-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28033-2

  • Online ISBN: 978-3-319-28034-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation