|
|
|
|
References
|
|
| |
| 1. |
Alidrisi M., “Linear programming model for the optimal control of a queueing network”, Intern. J. Syst. Sci., 18 (1987), 1079–1089     |
| 2. |
Azaron A., Ghomi S. M., “Optimal control of the service rates and arrivals in Jackson networks”, Eur. J. Oper. Res., 147:1 (2003), 17–31 |
| 3. |
Weber R. R., Stidham S., “Optimal control of service rates in networks of queues”, Advances in Applied Probability, 19 (1987), 202–218 |
| 4. |
Jo K. Y., “Decomposition approximation of queueing-network control models with
tree structures”, Annals of Operations Research, 8 (1987), 117–132 |
| 5. |
Alidrisi M., “Optimal control of the service rate of an exponential queueing network
using Markov decision theory”, Intern. J. Syst. Sci., 21 (1990), 2553–2563 |
| 6. |
Bruell S. C., Balbo G., Afshari P. V., “Mean value analysis of mixed, multiple class BCMP networks with load
dependent service stations”, Performance Evaluation, 4 (1984), 241–260 |
| 7. |
Mitra D., McKenna J., “Asymptotic expansions for closed Markovian networks with
state-dependent service rates”, J. of the Association for Computing Machinery, 33:3 (1986), 568–592 |
| 8. |
Lyakhov A. I., “Asimptoticheskii analiz zamknutykh setei ocheredei, vklyuchayuschikh
ustroistva s peremennoi intensivnostyu obsluzhivaniya”, Avtomatika i telemekhanika, 1997, no. 3, 131–143  |
| 9. |
Mandelbaum A., Massey W. A., Reiman M. I., “Strong approximations for Markovian service networks”, Queueing Systems, 30 (1998), 149–201 |
| 10. |
Mitrofanov Yu. I., Dolgov V. I., “Dinamicheskoe upravlenie intensivnostyami obsluzhivaniya v setyakh massovogo
obsluzhivaniya”, AVT, 2008, no. 6, 44–56 |
| 11. |
Barucha-Rid A. T., Elementy teorii markovskikh protsessov i ikh prilozheniya, Nauka, GRFML, M., 1969, 512 pp. |
| 12. |
Mitrofanov Yu. I., Analiz setei massovogo obsluzhivaniya, Nauch. kniga, Saratov, 2005, 175 pp. |
