Algorithmic computation of steady-state probabilities in an almost observable \(GI/M/c\) queue with or without vacations under state dependent balking and reneging (Q2290578): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Veena Goswami / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Abhijit Datta Banik / rank | |||
Normal rank | |||
Revision as of 13:31, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic computation of steady-state probabilities in an almost observable \(GI/M/c\) queue with or without vacations under state dependent balking and reneging |
scientific article |
Statements
Algorithmic computation of steady-state probabilities in an almost observable \(GI/M/c\) queue with or without vacations under state dependent balking and reneging (English)
0 references
29 January 2020
0 references
renewal arrival
0 references
multi-server
0 references
state-dependent balking
0 references
equilibrium balking strategy
0 references
reneging
0 references
multiple synchronous vacations
0 references
