Analysis of a random N-policy Geo/G/1 queue with the server subject to repairable breakdowns

References

• Yadin M, Naor P. Queueing systems with a removable service station. J Oper Res Soc. 1963;14:393–405.10.1057/jors.1963.63
   Google Scholar
• Heyman DP. Optimal operating policies for M/G/1 queuing systems. Oper Res. 1968;16:362–82 .10.1287/opre.16.2.362
   Web of Science ®Google Scholar
• Wang K-H, Huang K-B. Optimal control of an M/Ek/1 queueing system with a removable service station. J Oper Res Soc. 1995;46:1014–22.10.1057/jors.1995.138
   Web of Science ®Google Scholar
• Wang K-H, Ke J-C. A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity. Appl Math Model. 2000;24:899–914.10.1016/S0307-904X(00)00024-X
   Web of Science ®Google Scholar
• Ke J-C, Wang K-H. A recursive method for the N policy G/M/1 queueing system with finite capacity. Eur J Oper Res. 2002;142(3):577–94.10.1016/S0377-2217(01)00317-4
   Web of Science ®Google Scholar
• Tadj L, Choudhury G. Optimal design and control of queues. Top. 2005;13(2):359–412.10.1007/BF02579061
   Google Scholar
• Bell CE. Characterization and computation of optimal policies for operating an M/G/1 queuing system with removable server. Oper Res. 1971;19:208–18. 10.1287/opre.19.1.208
   Web of Science ®Google Scholar
• Kimura T. Optimal control of an M/G/1 queuing system with removable server via diffusion approximation. Eur J Oper Res. 1981;8:390–8.10.1016/0377-2217(81)90009-6
   Web of Science ®Google Scholar
• Bisdikian CC. The random N-policy. INFOCOM ‘94. Networking for Global Communications, 13th Proceedings IEEE; 1994 Jun 12–16; Toronto, Canada; p. 1178 –2182.10.1109/INFCOM.1994.337572
   Google Scholar
• Wang K-H, Wang T-Y, Pearn WL. Maximum entropy analysis to the N policy M/G/1 queueing system with server breakdowns and general startup times. Appl Math Comput. 2005;165:45–61.10.1016/j.amc.2004.04.115
   Web of Science ®Google Scholar
• Ke J-C. On M/G/1 system under NT policies with breakdowns, startup and closedown. Appl Math Model. 2006;30:49–66.10.1016/j.apm.2005.03.022
   Web of Science ®Google Scholar
• Wang K-H, Wang T-Y, Pearn WL. Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup times. Appl Math Model. 2007;31:2199–212.10.1016/j.apm.2006.08.016
   Web of Science ®Google Scholar
• Wang K-H, Huang K-B. A maximum entropy approach for the <p, N>-policy M/G/1 queue with a removable and unreliable server. Appl Math Model. 2009;33(4):2024–34.10.1016/j.apm.2008.05.007
   Web of Science ®Google Scholar
• Choudhury G, Ke J-C, Tadj L. The N-policy for an unreliable server with delaying repair and two phases of service. J Comput Appl Math. 2009;231:349–364.10.1016/j.cam.2009.02.101
   Web of Science ®Google Scholar
• Choudhury G, Tadj L, Ke J-C. A two-phase service system with Bernoulli vacation schedule, setup time and N-policy for an unreliable server with delaying repair. Qual Technol Quant Manage. 2011;8(3):271–84.
   Web of Science ®Google Scholar
• Chang YC, Pearn WL. Optimal management for infinite capacity N-policy M/G/1 queue with a removable service station. Int J Syst Sci. 2011;42(7):1075–83 .10.1080/00207721.2011.570480
   Web of Science ®Google Scholar
• Yang D-Y, Wang K-H, Pearn WL. Optimization on (N, p)-policy for an unreliable queue with second optional service and start-up. J Chin Inst Ind Eng. 2011;28(6):411–24.
   Google Scholar
• Takagi H. Queueing analysis: a foundation of performance evaluation: discrete-time systems. Vol. 3. Amsterdam: North-Holland; 1993.
   Google Scholar
• Bohm W, Mohanty SG. On discrete time Markovian N-policy queues involving batches. Sankhya: Indian J Stat. 1994;56:144–63.
   Google Scholar
• Moreno P. A discrete-time single-server queue with a modified N-policy. Int J Syst Sci. 2007;38(6):483–92.10.1080/00207720701353405
   Web of Science ®Google Scholar
• Moreno P. Analysis of a Geo/G/1 queueing system with a generalized N-policy and setup-closedown times. Qual Technol Quant Manage. 2008;5:111–28.
   Google Scholar
• Wang T-Y, Ke J-C. The randomized threshold for the discrete-time Geo/G/1 queue. Appl Math Model. 2009;33:3178–85.10.1016/j.apm.2008.10.010
   Web of Science ®Google Scholar
• Wang T-Y. Random N-policy Geo/G/1 queue with startup and closedown times. J Appl Math. 2012;2012( Article ID 793801):19.doi:10.1155/2012/793801.
   Web of Science ®Google Scholar
• Moreno P. A discrete-time retrial queue with unreliable server and general server lifetime. J Math Sci. 2006;132(5):643–55.10.1007/s10958-006-0009-x
   Google Scholar
• Atencia, I, Moreno P. A discrete-time Geo/G/1 retrial queue with server breakdowns. Asia-Pacific J Oper Res. 2006;23(2):247–71.10.1142/S0217595906000929
   Web of Science ®Google Scholar
• Tang Y, Yun X, Huang S. Discrete-time GeoX/G/1 queue with unreliable server and multiple adaptive delayed vacations. J Comput Appl Math. 2008;220:439–55.10.1016/j.cam.2007.08.019
   Web of Science ®Google Scholar
• Wang T-Y, Ke J-C, Chang F-M. Analysis of a discrete-time queue with server subject to vacations and breakdowns. J Ind Prod Eng. 2013;30(1):54–66.10.1080/10170669.2012.762060
   Google Scholar
• Hunter JJ. Mathematical techniques of applied probability, discrete time models: techniques and applications. Vol. 2, New York (NY): Academic; 1983.
   Google Scholar
• Domer B, Raphael B, Shea K, Smith I. A study of two stochastic search methods for structural control. J Comput Civil Eng. 2003;17(3):132–41.10.1061/(ASCE)0887-3801(2003)17:3(132)
   Web of Science ®Google Scholar
• Raphael B, Smith IFC. A direct stochastic algorithm for global search. Appl Math Comput. 2003;146:729–58.10.1016/S0096-3003(02)00629-X
   Web of Science ®Google Scholar