4
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

Optimal Hysteresis Control for BMAP/SM/1 Queue with MAP-Input of Disasters

Pages 395-405 | Received 01 Oct 2005, Accepted 01 May 2006, Published online: 09 Feb 2016

References

  • Artalejo, J. (2000). G-networks: A versatile approach for work removal in queueing networks. European Journal of Operational Research, 126, 233–249.
  • Artalejo, J. R. and Economou, A. (2005). Markovian controllable queueing systems with hysteretic policies. busy period and waiting time analysis. Methodology and Computing in Applied Probability, 7, 353–378.
  • Bocharov, P. P. and Vishnenskij, V. M. (2003). G-networks: development of the theory of multiplicative networks. Automation and Remote Control, 64(5), 714–739.
  • Dudin, A. N. (2002). Optimal hysteresis control for an unreliable BMAP/SM/1 system with two operation modes. Automation and Remote Control, 63(10), 1585–1596.
  • Dudin, A. N. and Karolik, A. V. (2001). BMAP/SM/1 queue with Markovian input of disasters and non-instantaneous recovery. Performance Evaluation, 45, 19–32.
  • Dudin, A. N. and Nishimura, S. (1999). A BMAP/SM/1 queueing system with Markovian arrival of disasters. Journal of Applied Probability, 36(3), 868–881.
  • Dudin, A. N. and Nishimura, S. (1999). Optimal control for a BMAP/G/1 queue with two service modes. Mathematical Problems in Engineering, 5, 255–273.
  • Dudin, A. N. and Nishimura, S. (2000). Optimal hysteresis control for a BMAP/SM/1/N queue with two operation modes. Mathematical Problems in Engineering, 5(5), 397–420.
  • Gail, H. R., Hantler, S. L. and Taylor, B. A. (1997). Non-skip-free M/G/1 and G/M/1 type Markov chains. Advance in Applied Probability, 29, 733–758.
  • Gelenbe, E. (1991). Queueing networks with negative and positive customers. Journal of Applied Probability, 28, 655–663.
  • Jain, G. and Sigman, K. (1996). A Pollaczeck-Khinchine formula for M/G/1 queues with disasters. Journal of Applied Probability, 33, 1191–1200.
  • Kitaev, M. Yu. and Serfozo, R. F. (1999). M/M/1 queues with switching costs and hysteretic optimal control. Operations Research, 47, 310–312.
  • Lu, F. V. and Serfozo, R. F. (1984). M/M/1 queueing decision prosess with monotone hysteresis optimal policies. Operations Research, 32, 1116–1129.
  • Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival processes. Communications in Statistics: Stochastic Models, 7, 1–46.
  • Lucantoni, D. M. and Neuts, M. F. (1994). Some steady-state distributions for the BMAP/SM/1 queue. Communications in Statistics: Stochastic Models, 10, 575–598.
  • Neuts, M. F. (1989). Structured Stochastic Matrices of M/G/1 Type Applications, Marcel Dekker, New York.
  • Nishimura, S. N. and Jiang, Y. (1995). An M/G/1 vacation model with two service modes. Probability in the Engineering and Informational Sciences, 9, 355–374.
  • Nobel, R. D. (1998). A regenerative approach for an M x/G/1 queue with two service modes. Automatic Control and Computer Sciences, 32, 3–14.
  • Nobel, R. D. and Tijms, H. C. (1999). Optimal control for a Mx/G/1 queue with two service modes. European Journal of Operational Research, 113(3), 610–619.
  • Rykov, V. V. (1995). Hysteresis phenomema in controllable queueing systems. Vestnik of Russian University of People Friendship, 3, 101–111.
  • Semenova, O. V. (2004). Optimal control for a BMAP/SM/1 queue with MAP -input of disasters and two operation modes. RAIRO Operations Research, 38(2), 153–171.
  • Skorokhod, X. (1980). Probability Theory and Random Process, High School, Kiev.
  • Yadin, M. and Naor, P. (1967). On queueing systems with variable service capacities. Naval Research Logistics Quarterly, 14, 43–53.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.