Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 793801, 19 pages
http://dx.doi.org/10.1155/2012/793801
Research Article

Random -Policy Geo/G/1 Queue with Startup and Closedown Times

Department of Accounting Information, National Taichung University of Science and Technology, Taichung 404, Taiwan

Received 23 July 2012; Revised 6 October 2012; Accepted 7 October 2012

Academic Editor: Han H. Choi

Copyright © 2012 Tsung-Yin Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Yadin and P. Naor, “Queueing systems with a removable service station,” Operational Research Quarterly, vol. 14, pp. 393–405, 1963. View at Google Scholar
  2. D. P. Heyman, “Optimal operating policies for M/G/1 queueing system,” Operations Research, vol. 16, pp. 362–382, 1968. View at Google Scholar
  3. C. E. Bell, “Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server,” Operations Research, vol. 19, pp. 208–218, 1971. View at Google Scholar
  4. K. H. Wang and J. C. Ke, “A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity,” Applied Mathematical Modelling, vol. 24, no. 12, pp. 899–914, 2000. View at Publisher · View at Google Scholar · View at Scopus
  5. J.-C. Ke and K.-H. Wang, “A recursive method for the N policy G/M/1 queueing system with finite capacity,” European Journal of Operational Research, vol. 142, no. 3, pp. 577–594, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. Z. G. Zhang and N. Tian, “The N threshold policy for the GI/M/1 queue,” Operations Research Letters, vol. 32, no. 1, pp. 77–84, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. J. Medhi and J. G. C. Templeton, “A poisson input queue under N-policy and with a general start up time,” Computers and Operations Research, vol. 19, no. 1, pp. 35–41, 1992. View at Google Scholar · View at Scopus
  8. H. Takagi, “A M/G/1/K queues with N-policy and setup times,” Queueing Systems. Theory and Applications, vol. 14, no. 1-2, pp. 79–98, 1993. View at Publisher · View at Google Scholar
  9. H. W. Lee and J. O. Park, “Optimal strategy in N-policy production system with early set-up,” Journal of the Operational Research Society, vol. 48, no. 3, pp. 306–313, 1997. View at Google Scholar · View at Scopus
  10. S. Hur and S. J. Paik, “The effect of different arrival rates on the N-policy of M/G/1 with server setup,” Applied Mathematical Modelling, vol. 23, no. 4, pp. 289–299, 1999. View at Google Scholar · View at Scopus
  11. K. H. Wang, T. Y. Wang, and W. L. Pearn, “Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup times,” Applied Mathematical Modelling, vol. 31, no. 10, pp. 2199–2212, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. C. C. Bisdikian, “Random N-policy,” in Proceedings of IEEE 13th Networking for Global Communications (INFOCOM '94), pp. 1178–1182, June 1994. View at Scopus
  13. O. Kella, “The threshold policy in the M/G/1 queue with server vacations,” Naval Research Logistics, vol. 36, no. 1, pp. 111–123, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. H. W. Lee, S. S. Lee, J. O. Park, and K. C. Chae, “Analysis of the MX/G/1 queue with N-policy and multiple vacations,” Journal of Applied Probability, vol. 31, no. 2, pp. 476–496, 1994. View at Publisher · View at Google Scholar
  15. K. C. Chae and H. W. Lee, “MX/G/1 vacation models with N-policy: heuristic interpretation of the mean waiting time,” Journal of the Operational Research Society, vol. 46, no. 2, pp. 258–264, 1995. View at Google Scholar · View at Scopus
  16. S. S. Lee, H. W. Lee, S. H. Yoon, and K. C. Chae, “Batch arrival queue with N-policy and single vacation,” Computers and Operations Research, vol. 22, no. 2, pp. 173–189, 1995. View at Google Scholar · View at Scopus
  17. G. V. Krishna Reddy, R. Nadarajan, and R. Arumuganathan, “Analysis of a bulk queue with N-policy multiple vacations and setup times,” Computers & Operations Research, vol. 25, no. 11, pp. 957–967, 1998. View at Publisher · View at Google Scholar
  18. J. C. Ke, “The optimal control of an M/G/1 queueing system with server startup and two vacation types,” Applied Mathematical Modelling, vol. 27, no. 6, pp. 437–450, 2003. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Arumuganathan and S. Jeyakumar, “Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times,” Applied Mathematical Modelling, vol. 29, no. 10, pp. 972–986, 2005. View at Publisher · View at Google Scholar · View at Scopus
  20. J. C. Ke, “On M/G/1 system under NT policies with breakdowns, startup and closedown,” Applied Mathematical Modelling, vol. 30, no. 1, pp. 49–66, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. G. Choudhury, J.-C. Ke, and L. Tadj, “The N-policy for an unreliable server with delaying repair and two phases of service,” Journal of Computational and Applied Mathematics, vol. 231, no. 1, pp. 349–364, 2009. View at Publisher · View at Google Scholar
  22. C.-C. Kuo, K.-H. Wang, and S.-L. Lee, “Optimal control of the p,N-policy M/G/1queue with server breakdowns and general startup Time,” International Journal of Information and Management Sciences, vol. 20, no. 4, pp. 565–577, 2009. View at Google Scholar
  23. J.-C. Ke, H.-I. Huang, and Y.-K. Chu, “Batch arrival queue with N-policy and at most J vacations,” Applied Mathematical Modelling, vol. 34, no. 2, pp. 451–466, 2010. View at Publisher · View at Google Scholar
  24. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation: Discrete-time Systems, vol. 3, North-Holland, Amsterdam, The Netherland, 1993.
  25. W. Böhm and S. G. Mohanty, “On discrete time Markovian N-policy queues involving batches,” Sankhyā A, vol. 56, no. 1, pp. 144–163, 1994. View at Google Scholar
  26. P. Moreno, “A discrete-time single-server queue with a modified N-policy,” International Journal of Systems Science, vol. 38, no. 6, pp. 483–492, 2007. View at Publisher · View at Google Scholar
  27. P. Moreno, “Analysis of a Geo/G/1 queueing system with a generalized N-policy and setup-closedown times,” Quality Technology & Quantitative Management, vol. 5, no. 2, pp. 111–128, 2008. View at Google Scholar
  28. T. Y. Wang and J. C. Ke, “The randomized threshold for the discrete-time Geo/G/1 queue,” Applied Mathematical Modelling, vol. 33, no. 7, pp. 3178–3185, 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. J. J. Hunter, Mathematical Techniques of Applied Probability, Discrete Time Models: Techniques and Applications, vol. 2, Academic Press, New York, NY, USA, 1983.