Optimization of service rate in a discrete-time impatient customer queue using particle swarm optimization

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Laxmi, P. V., & Jyothsna, K. (2016). Optimization of service rate in a discrete-time impatient customer queue using particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9581, pp. 38–42). Springer Verlag. https://doi.org/10.1007/978-3-319-28034-9_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free