Advertisement

Journal of Statistical Theory and Practice

, Volume 4, Issue 1, pp 137–153 | Cite as

Batch Arrival Vacation Queue with Second Optional Service and Random System Breakdowns

  • Farzana A. Maraghi
  • Kailash C. Madan
  • Ken Darby-Dowman
Article

Abstract

A single server queue with a second optional service, Bernoulli schedule server vacations, and random system breakdowns was analyzed. It is assumed that customers arrive to the system in batches of variable size, but served one by one. As soon as the first service of a customer is completed, then with probability k he may opt for the second service. After a customer is served, the server may decide to leave the system with probability p, or to continue serving customers with probability 1 − p. If the system breaks down, it enters a repair process immediately. The repair time and the vacation time both are assumed to have general distributions. We obtain steady state results in explicit and closed form in terms of the probability generating functions for the number of customers in the queue, the average number of customers, and the average waiting time in the queue. Some special cases of interest are presented and a numerical illustration is provided.

AMS Subject Classification

60K25 

Keywords

Mx/G/1 queue Batch arrival Vacation time Bernoulli schedule Second optional service Random breakdown Steady state Queue size 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aissani, A., Artalejo, J.R., 1998. On the single server retrial queue subject to breakdowns. Queueing Systems, 30, 309–321.MathSciNetCrossRefGoogle Scholar
  2. Al-Jararha, J., Madan, K., 2003. An M/G/1 queue with second optional service with general service time distribution. Information and Management Sciences, 14, 47–56.MathSciNetMATHGoogle Scholar
  3. Bunday, B.D., 1996. An Introduction to Queueing Theory. Oxford University Press, Oxford, England.MATHGoogle Scholar
  4. Chae, K.C., Lee, H.W., Ahn, C.W., 2001. An arrival time approach to M/G/1-type queues with generalized vacations. Queueing Systems, 38, 91–100.MathSciNetCrossRefGoogle Scholar
  5. Chang, S.H., Takine, T., 2005. Factorization and stochastic decomposition properties in bulk queues with generalized vacations. Queueing Systems, 50, 165–183.MathSciNetCrossRefGoogle Scholar
  6. Choudhury, G., 2008. A single server queueing system with two phase of service and vacations. Quality Technology and Quantitative Management, 5, 33–49.MathSciNetCrossRefGoogle Scholar
  7. Choudhury, G., Borthakur, A., 2000. The stochastic decomposition results of batch arrival Poisson queue with a grand vacation process. Sankhyā, 62, 448–462.MathSciNetMATHGoogle Scholar
  8. Choudhury, G., Madan, K., 2005. A two-stage batch arrival queueing system with a modified Bernoulli schedule vacation under N-policy. Mathematical and Computer Modeling, 42, 71–85.MathSciNetCrossRefGoogle Scholar
  9. Doshi, B.T., 1985. A note on stochastic decomposition in a GI/G/1 queue with vacations or setup times. Journal of Applied Probability, 22, 419–428.MathSciNetCrossRefGoogle Scholar
  10. Doshi, B.T., 1986. Queueing systems with vacations — A survey. Queueing Systems, 1, 29–66.MathSciNetCrossRefGoogle Scholar
  11. Federgruen, A., So, K.C., 1990. Optimal maintenance policies for single-server queueing systems subject to breakdowns. Operations Research, 38, 330–343.MathSciNetCrossRefGoogle Scholar
  12. Hur, S., Ahn, S., 2005. Batch arrival queues with vacations and server setup. Applied Mathematical Modeling, 29, 1164–1181.CrossRefGoogle Scholar
  13. Igaki, N., 1992. Exponential two server queue with N-Policy and general vacation. Queueing System, 10, 279–294.MathSciNetCrossRefGoogle Scholar
  14. Jayawardene, A.K., Kella, O., 1996. M/G/∞ with altering renewal breakdowns. Queueing Systems, 22, 79–95.CrossRefGoogle Scholar
  15. Ke, J.C., 2007a. Batch arrival queues under vacation policies with server breakdowns and startup/closedown times. Applied Mathematical Modelling, 31, 1282–1292.CrossRefGoogle Scholar
  16. Ke, J.C., 2007b. Operating characteristic analysis on the M[x]/G/1 system with a variant vacation policy and balking. Applied Mathematical Modelling, 31, 1321–1337.CrossRefGoogle Scholar
  17. Keilson, J., Servi, L.D., 1986. Oscillating random walk models for GI/G/1 vacation system with Bernoulli schedules. Journal of Applied Probability, 23, 790–802.MathSciNetCrossRefGoogle Scholar
  18. Kulkarni, V.G., Choi, B.D., 1990. Retrial queues with server subject to breakdowns and repairs. Queueing Systems, 7, 191–209.MathSciNetCrossRefGoogle Scholar
  19. Kumar, M.S., Arumuganathan, R., 2008. On the single server batch arrival retrial queue with general vacation time under Bernoulli schedule and two phase of heterogeneous service. Quality Technology and Quantitative Management, 5, 145–160.MathSciNetCrossRefGoogle Scholar
  20. Levy, Y., Yechiali, U., 1975. Utilization of idle time in an M/G/1 queueing system. Management Science, 22, 202–211.CrossRefGoogle Scholar
  21. Madan, K.C., Abu Al-Rub, A.Z., 2004. On a single server queue with optional phase type server vacations based on exhaustive deterministic service and a single vacation policy. Applied Mathematics and Computation, 149, 723–734.MathSciNetCrossRefGoogle Scholar
  22. Madan, K.C., Abu-Deyyeh, W., Gharaibeh, M., 2003. On two parallel servers with random breakdowns. Soochow Journal of Mathematics, 29, 413–423.MathSciNetMATHGoogle Scholar
  23. Madan, K.C., Abu-Dayyeh, W., Saleh, M.F., 2002. An M/G/1 queue with second optional service and Bernoulli schedule server vacations. Systems Science, 28, 51–62.MathSciNetGoogle Scholar
  24. Núñez-Queija, R., 2000. Sojourn times in a processor sharing queue with service interruptions. Queueing Systems, 34, 351–386.MathSciNetCrossRefGoogle Scholar
  25. Takine, T., Sengupta, B., 1997. A single server queue with service interruptions. Queueing Systems, 26, 285–300.MathSciNetCrossRefGoogle Scholar
  26. Tian, N., Li, Q., Cao, J., 1999. Conditional stochastic decomposition in M/M/c queue with server vacations. Stochastic Models, 15, 367–377.MathSciNetCrossRefGoogle Scholar
  27. Tian, N., Zhang, Z.G., 2002. The discrete-time GI/Geo/1 queue with multiple vacations. Queueing Systems, 40, 283–294.MathSciNetCrossRefGoogle Scholar
  28. Vinck, B., Bruneel, H., 2006. System delay versus system content for discrete-time queueing systems subject to server interruptions. European Journal of Operational Research, 175, 362–375.MathSciNetCrossRefGoogle Scholar
  29. Wang, J., 2004. An M/G/1 queue with second optional service and server breakdowns. Computers and Mathematics with Applications, 47, 1713–1723.MathSciNetCrossRefGoogle Scholar
  30. Wang, J., Cao, J., Li, Q., 2001. Reliability analysis of the retrial queue with server breakdowns and repairs. Queueing Systems, 38, 363–380.MathSciNetCrossRefGoogle Scholar
  31. Wang, K.H., Chiang, Y.C., Ke, J.C., 2003. Cost analysis of the unloader queueing system with a single unloader subject to breakdowns. Journal of the Operational Research Society, 54, 515–520.CrossRefGoogle Scholar
  32. Zhou, W.H., 2005. Analysis of a single-server retrial queue with FCFS orbit and Bernoulli vacation. Applied Mathematics and Computation, 161, 353–364.MathSciNetCrossRefGoogle Scholar

Copyright information

© Grace Scientific Publishing 2010

Authors and Affiliations

  • Farzana A. Maraghi
    • 1
  • Kailash C. Madan
    • 2
  • Ken Darby-Dowman
    • 1
  1. 1.School of Information Systems, Computing and MathematicsBrunel UniversityUxbridgeUK
  2. 2.College of Mathematical Sciences and ITAhlia UniversityManamaKingdom of Bahrain

Personalised recommendations