Performance Analysis and Cost Optimization of an M/M/1 Queue with N-Policy and Working Breakdown

K. V. Vijayashree () and P. Pavithra ()
Additional contact information
K. V. Vijayashree: Anna University
P. Pavithra: Anna University

Methodology and Computing in Applied Probability, 2025, vol. 27, issue 3, 1-26

Abstract: Abstract This paper examines the impact of operational breakdown in an $$\varvec{M}\varvec{/}\varvec{M}\varvec{/}\varvec{1}$$ queueing system with $$\varvec{N}$$ -policy. The system is initially idle. Once $$\varvec{N}$$ customers have arrived, it begins to provide service, which continues until the system becomes empty. An exponentially distributed pre-service task is introduced following each idle period. Subsequently, the server may encounter breakdown during busy period, wherein it continues to operate at a slower pace. We establish a stability condition for the existence of a steady state, and using the probability generating function method, we obtain the steady state probabilities in closed form. Key performance measures are then derived. Numerical examples demonstrate the variations in system performance, and performance metrics are validated through simulation using Arena software. A cost function is formulated, and the particle swarm optimization algorithm is applied to reduce the overall cost by determining the optimal decision variables. Furthermore, different parameters are investigated to analyze how they influence the anticipated overall cost. The optimization results highlight that the service rates surpass the customer arrival rate, while an optimal service rate ensures efficient operation. Additionally, an application related to wireless sensor networks and robotic manipulators is discussed.

Keywords: $$\varvec{N}$$ -policy; Working breakdown; Probability generating function; Arena; Particle swarm optimization; Wireless sensor networks; Robotic manipulators; 60K25; 90B22 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-025-10196-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:27:y:2025:i:3:d:10.1007_s11009-025-10196-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-025-10196-0

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().