|
[1] Bellman R., Introduction to Matrix Analysis, MacGraw-Hill, London, (1960). [2] Bertsimas D., An exact FCFS waiting time analysis for a class of G/G/s queue-ing systems. QUESTA 3, 305-320, (1988). [3] Bertsimas D., An analytic approach to a general class of G/G/s queueing sys-tems. Operations Research 38 , 139-155, (1990). [4] Golub, G.H., and Van Loan, C.F., Matrix{Computations, The John Hopkins University Press, (1989). [5] Chao, X., Pinedo, M. and Shaw, D., An Assembly Network of Queues with Product Form Solution. Journal of Applied Probability, 33, 858-869, (1996). [6] Chao, X., Miyazawa, M., Serfozo, R., and Takada. H., Necessary and sufficient conditions for product form queueing networks. Queueing Systems, Vol 28, 377-401, (1998). [7] Le Boudec, J.Y., Steady-state probabilities of the PH/PH/1 queue. Queueing Systems 3, 73-88, (1988). [8] Neuts, M.F. Matrix-Geometric Solutions in Stochastic Models. The John Hop-kins University Press, (1981). [9] Neuts, M.F. and Takahashi, Y. Asymptotic behavior of the stationary dis-tributions in the GI/PH/c queue with heterogeneous servers. Z. Wahrschein-lichkeitstheorie verw. Gebiete, 57, 441-452, (1988).
|