Abstract
This paper investigates a discrete-time single server finite buffer queue with single working vacation wherein the customers decide either to join the queue or balk. The inter-arrival times, service times and vacation times are assumed to be independent and geometrically distributed. Using matrix method, the steady-state probabilities are obtained. Various performance measures of the model and average sojourn time are presented. An optimization problem is considered using particle swarm optimization (PSO) through a cost function. Further, maximum likelihood estimate (MLE) for the balking parameter is obtained. Numerical results are presented in the form of tables and graphs to show the effect of parameters on the system performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
