1 |
Kim, J. S. (2006), Asymptotic analysis of the loss probability in the GI/PH/1/K queue, Journal of Applied Mathematics & Computing, 22(1), 273-283.
DOI
|
2 |
Latouche, G. (1993), Algorithms for infinite Markov chains with repeating columns. In Meyer, C. D. and Plemmons, R. D. (eds.), Linear Algebra, Markov Chains and Queueing Models, Springer, New York, NY, 231-265.
|
3 |
Latouche, G. and Ramaswami, V. (1999), Introduction to Matrix Analytic Methods in Stochastic Modeling, Society for Industrial and Applied Mathematics, Philadelphia, PA.
|
4 |
Neuts, M. F. (1981a), Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, Johns Hopkins University Press, Baltimore, MD.
|
5 |
Neuts, M. F. (1981b), Stationary waiting-time distributions in the GI/PH/1 queue, Journal of Applications Probability, 18(4), 901-912.
DOI
ScienceOn
|
6 |
Ramaswami, V. and Latouche, G. (1989), An experimental evaluation of the matrix-geometric method for the GI/PH/1 queue, Communications in Statistics: Stochastic Models, 5(4), 629-667.
DOI
|
7 |
Ramaswami, V. and Lucantoni, D. M. (1988), Moments of the stationary waiting time in the GI/PH/1 queue, Journal of Applications Probability, 25(3), 636-641.
DOI
ScienceOn
|
8 |
Sengupta, B. (1989), Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue, Advances in Applied Probability, 21(1), 159-180.
DOI
ScienceOn
|
9 |
Sengupta, B. (1990), The semi-Markovian queue: theory and applications, Communications in Statistics: Stochastic Models, 6(3), 383-413.
DOI
|
10 |
Chakravarthy, S. (1992), A finite capacity GI/PH/1 queue with group services, Naval Research Logistics, 39(3), 345-357.
DOI
|
11 |
Chaudhry, M. L. and Templeton, J. G. C. (1983), A First Course in Bulk Queues, John Wiley & Sons, New York, NY.
|
12 |
Dudin, A. N. and Klimenok, V. I. (2003), Optimal admission control in a queueing system with heterogeneous traffic, Operations Research Letters, 31(2), 108-118.
DOI
ScienceOn
|
13 |
Chaudhry, M. L., Harris, C. M., and Marchal, W. G. (1990), Robustness of root finding in single-server queueing models, INFORMS Journal on Computing, 2(3), 273-286.
DOI
|
14 |
Chaudhry, M. L., Samanta, S. K., and Pacheco, A. (2012), Analytically explicit results for the GI/C-MSP/1/ queueing system using roots, Probability in the Engineering and Informational Sciences, 26(2), 221-244.
DOI
|
15 |
Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977), Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society: Series B, 39(1), 1-38.
|
16 |
Dudin, A. N., Kim, C. S., and Semyonova, O. V. (2004), An optimal multithreshold control for the input flow of the GI/PH/1 queueing system with a BMAP flow of negative customers, Avtomatika i Telemekhanika, 9, 71-84.
|
17 |
Grassmann, W. K. (1982), The GI/PH/1 queue: a method to find the transition matrix, INFOR, 20, 144-156.
|
18 |
Guo, M. M., Tian, N. S., and Liu, A. Y. (2007), Queue system GI/PH/1 with repairable service station, Operations Research and Management Science, 16(5), 69-74.
|
19 |
Kao, E. P. C. (1991), Using state reduction for computing steady state probabilities of queues of GI/PH/1 types, ORSA Journal on Computing, 3(3), 231-240.
DOI
|
20 |
Kao, E. P. C. (1996), A comparison of alternative approaches for numerical solutions of GI/PH/1 queues, INFORMS Journal on Computing, 8(1), 74-85.
DOI
|
21 |
Baum, D. and Breuer, L. (2006), Applying Foster's criteria to a GI/PH/1 queueing system, Cybernetics and Systems Analysis, 42(3), 433-439.
DOI
|
22 |
Asmussen, S. (1992), Phase-type representations in random walk and queueing problems, Annals of Probability, 20(2), 772-789.
DOI
ScienceOn
|
23 |
Asmussen, S., Nerman, O., and Olsson, M. (1996), Fitting phase-type distributions via the EM algorithm, Scandinavian Journal of Statistics, 23(4), 419-441.
|