Cost Optimization in a GI/M/2/N Queue with Heterogeneous Servers, Working Vacations, and Impatient Customers via the Bat Algorithm

This paper analyzes a finite-capacity GI/M/2/N queue with two heterogeneous servers operating under a multiple working-vacation policy, Bernoulli feedback, and customer impatience. Using the supplementary-variable technique in tandem with a tailored recursive scheme, we derive the stationary distributions of the system size as observed at pre-arrival instants and at arbitrary epochs. From these, we obtain explicit expressions for key performance metrics, including blocking probability, average reneging rate, mean queue length, mean sojourn time, throughput, and server utilizations. We then embed these metrics in an economic cost function and determine service-rate settings that minimize the total expected cost via the Bat Algorithm. Numerical experiments implemented in R validate the analysis and quantify the managerial impact of the vacation, feedback, and impatience parameters through sensitivity studies. The framework accommodates general renewal arrivals (GI), thereby extending classical (M/M/2/N) results to more realistic input processes while preserving computational tractability. Beyond methodological interest, the results yield actionable design guidance: (i) they separate Palm and time-stationary viewpoints cleanly under non-Poisson input, (ii) they retain heterogeneity throughout all formulas, and (iii) they provide a cost–optimization pipeline that can be deployed with routine numerical effort. Methodologically, we (i) characterize the generator of the augmented piecewise–deterministic Markov process and prove the existence/uniqueness of the stationary law on the finite state space, (ii) derive an explicit Palm–time conversion formula valid for non-Poisson input, (iii) show that the boundary-value recursion for the Laplace–Stieltjes transforms runs in linear time O(N) and is numerically stable, and (iv) provide influence-function (IPA) sensitivities of performance metrics with respect to (μ1,μ2,ν,α,ϕ,β).

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-11-06
DOI
https://doi.org/10.3390/math13213559
Citations
1
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
2.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cost Optimization in a GI/M/2/N Queue with Heterogeneous Servers, Working Vacations, and Impatient Customers via the Bat Algorithm

Salim Bouzebda, Abdelhak Guendouzi
1 citations
Mathematics
Advanced Queuing Theory Analysis
2.28
article

Cost Optimization in a GI/M/2/N Queue with Heterogeneous Servers, Working Vacations, and Impatient Customers via the Bat Algorithm

Salim Bouzebda, Abdelhak Guendouzi
article en
1 citations

Abstract

This paper analyzes a finite-capacity GI/M/2/N queue with two heterogeneous servers operating under a multiple working-vacation policy, Bernoulli feedback, and customer impatience. Using the supplementary-variable technique in tandem with a tailored recursive scheme, we derive the stationary distributions of the system size as observed at pre-arrival instants and at arbitrary epochs. From these, we obtain explicit expressions for key performance metrics, including blocking probability, average reneging rate, mean queue length, mean sojourn time, throughput, and server utilizations. We then embed these metrics in an economic cost function and determine service-rate settings that minimize the total expected cost via the Bat Algorithm. Numerical experiments implemented in R validate the analysis and quantify the managerial impact of the vacation, feedback, and impatience parameters through sensitivity studies. The framework accommodates general renewal arrivals (GI), thereby extending classical (M/M/2/N) results to more realistic input processes while preserving computational tractability. Beyond methodological interest, the results yield actionable design guidance: (i) they separate Palm and time-stationary viewpoints cleanly under non-Poisson input, (ii) they retain heterogeneity throughout all formulas, and (iii) they provide a cost–optimization pipeline that can be deployed with routine numerical effort. Methodologically, we (i) characterize the generator of the augmented piecewise–deterministic Markov process and prove the existence/uniqueness of the stationary law on the finite state space, (ii) derive an explicit Palm–time conversion formula valid for non-Poisson input, (iii) show that the boundary-value recursion for the Laplace–Stieltjes transforms runs in linear time O(N) and is numerically stable, and (iv) provide influence-function (IPA) sensitivities of performance metrics with respect to (μ1,μ2,ν,α,ϕ,β).

MathematicsVol. 13(21)
Université de Technologie de Compiègne (FR), Agriculture and Forestry University (NP)
Openalex Percentile: Top 8%
Advanced Queuing Theory Analysis
2.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.