ERRATUM TO: Analysis of two heterogeneous server queueing model with balking, reneging and feedback Mathematical Sciences And Applications E-Notes, 2, No. 2, (2014), 10-21

Abstract

On page 04, after equation (3.2), we should have (λ + β(µ 1 + µ 2)) P 2 = (β(µ 1 + µ 2) + ηδ) P 3 + λP 1 , n = 2. (0.1) 2. Instead of equation (3.3), we should have λ n−1 + β(µ 1 + µ 2) + (n − 2)ηδ P n = (β(µ 1 + µ 2) + (n − 1)ηδ) P n+1 + λ n−2 P n−1 , 3 ≤ n ≤ N − 1.

ANFIS-Enhanced <i>M</i>/<i>M</i>/2 Queueing Model Investigation in Heterogeneous Server Systems with Catastrophe and Restoration

“…Bouchentouf [16] examined the QS with balking, reneging, and feedback made up of two heterogeneous servers, additionally exhibit how the different model parameters impact the system's behaviour. Singh [17] examined the steadystate properties of a bulk queueing model featuring a solitary server, encompassing balking capabilities, and inclusive of optional vacations.…”

Heterogeneous Server Retrial Queueing Model With Feedback and Working Vacation Using Artificial Bee Colony Optimization Algorithm

“…A non-preemptive priority structure that is heterogeneous has been studied by Leemans [12]. According to [3], a heterogeneous two-server queueing system with feedback, reverse balking, and reneging and retaining renege customers can be analyzed. Markovian queueing model with discouraged arrivals, reneging customers, and retention of reneged customers was studied by [11] based on two heterogeneous servers finite capacities.…”

Analysis of Instantaneous Feedback Queue with Heterogeneous Servers

“…Note that there are few works in the available literature devoted to the study of such models. Among them, we note the works [4][5][6][7][8][9][10][11][12][13]. Simple one-dimensional IFBQ models with one server and impatient calls using various mechanisms for keeping them in the queue at the moments of the end of the admissible waiting time are studied in [4][5][6][7][8][9][10].…”

“…Simple one-dimensional IFBQ models with one server and impatient calls using various mechanisms for keeping them in the queue at the moments of the end of the admissible waiting time are studied in [4][5][6][7][8][9][10]. A model with two heterogeneous servers and a bounded queue, in which incoming calls with known probabilities are assigned to the servers, was studied in [11]. Note that in [4][5][6][7][8][9][10][11] the primary calls and the calls that require repeated servicing are not distinguished.…”

“…A model with two heterogeneous servers and a bounded queue, in which incoming calls with known probabilities are assigned to the servers, was studied in [11]. Note that in [4][5][6][7][8][9][10][11] the primary calls and the calls that require repeated servicing are not distinguished. Therefore, using the approach proposed in them, it is impossible to find the distribution of the number of calls that require repeated servicing.…”