Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass; R. Arumuganathan

RAIRO - Operations Research (2012)

  • Volume: 46, Issue: 4, page 334-334
  • ISSN: 0399-0559

Abstract

top
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary service, if the queue size reaches ‘a’, during the secondary job period. On completion of the secondary job, the server remains in the system (dormant period) until the queue length reaches ‘a’. For the proposed model, the probability generating function of the steady state queue size distribution at an arbitrary time is obtained. Various performance measures are derived. A cost model for the queueing system is also developed. To optimize the cost, a numerical illustration is provided.

How to cite

top

Haridass, M., and Arumuganathan, R.. "Analysis of a MX/G(a,b)/1 queueing system with vacation interruption." RAIRO - Operations Research 46.4 (2012): 334-334. <http://eudml.org/doc/222499>.

@article{Haridass2012,
abstract = {In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary service, if the queue size reaches ‘a’, during the secondary job period. On completion of the secondary job, the server remains in the system (dormant period) until the queue length reaches ‘a’. For the proposed model, the probability generating function of the steady state queue size distribution at an arbitrary time is obtained. Various performance measures are derived. A cost model for the queueing system is also developed. To optimize the cost, a numerical illustration is provided.},
author = {Haridass, M., Arumuganathan, R.},
journal = {RAIRO - Operations Research},
keywords = {Bulk arrival; single server; batch service; vacation; interruption; bulk arrival},
language = {eng},
month = {11},
number = {4},
pages = {334-334},
publisher = {EDP Sciences},
title = {Analysis of a MX/G(a,b)/1 queueing system with vacation interruption},
url = {http://eudml.org/doc/222499},
volume = {46},
year = {2012},
}

TY - JOUR
AU - Haridass, M.
AU - Arumuganathan, R.
TI - Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
JO - RAIRO - Operations Research
DA - 2012/11//
PB - EDP Sciences
VL - 46
IS - 4
SP - 334
EP - 334
AB - In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary service, if the queue size reaches ‘a’, during the secondary job period. On completion of the secondary job, the server remains in the system (dormant period) until the queue length reaches ‘a’. For the proposed model, the probability generating function of the steady state queue size distribution at an arbitrary time is obtained. Various performance measures are derived. A cost model for the queueing system is also developed. To optimize the cost, a numerical illustration is provided.
LA - eng
KW - Bulk arrival; single server; batch service; vacation; interruption; bulk arrival
UR - http://eudml.org/doc/222499
ER -

References

top
  1. R. Arumuganathan and S. Jeyakumar, Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times. Appl. Math. Modell.29 (2005) 972–986.  
  2. M. Balasubramanian, R. Arumuganathan and A. Senthil Vadivu, Steady state analysis of a non-Markovian bulk queueing system with overloading and multiple vacations. Int. J. Oper. Res.9 (2010) 82–103.  
  3. M. Balasubramanian and R. Arumuganathan, Steady state analysis of a bulk arrival general bulk service queueing system with modififed M-vacation policy and variant arrival rate. Int. J. Oper. Res.11 (2011) 383–407.  
  4. A. Borthakur and J. Medhi, A queueing system with arrival and services in batches of variable size. Cahiers du. C.E.R.O.16 (1974) 117–126.  
  5. M.L. Chaudhry and J.G.C. Templeton, A first course in bulk queues. New York, John Wiley and Sons (1983).  
  6. B.T. Doshi, Single server queues with vacations : a survey, Queueing Systems. I (1986) 29–66.  
  7. B.T. Doshi, Single server queues with vacation, Stochastic Analysis of the Computer and Communication Systems, edited by H. Takagi. North-Holland/Elsevier, Amsterdam (1990) 217–264.  
  8. M. Haridass and R. Arumuganathan, Analysis of a batch arrival general bulk service queueing system with variant threshold policy for secondary jobs. Int. J. Math. Oper. Res.3 (2011) 56–77.  
  9. H. Zhang and D. Shi, The M/M/1 queue with Bernoulli-Schedule-Controlled vacation and vacation interruption. Int. J. Inf. Manag. Sci.20 (2009) 579–587.  
  10. Jau-Chuan Ke, Chia-Huang Wu and Wen Lea Pearn, Algorithmic analysis of the multi-server system with a modified Bernoulli vacation schedule. Appl. Math. Model.35 (2011) 2196–2208.  
  11. Ji-Hong Li and Nai-Shuo Tian, The M/M/1 queue with working vacations and vacation interruptions. J. Syst. Sci. Eng.16 (2007) 121–127.  
  12. Ji-Hong Li, Nai-Shuo Tian and Zhan-You Ma, Performance analysis of GI/M/1 queue with working vacations and vacation interruption. Appl. Math. Model.32 (2008) 2715–2730.  
  13. Ji-Hong Li and Nai-Shuo Tian, Performance analysis of a GI/M/1 queue with single working vacation. Appl. Math. Comput.217 (2001) 4960–4971.  
  14. G.V Krishna Reddy, R. Nadarajan and R. Arumuganathan, Analysis of a bulk queue with N-policy, multiple vacations and setup times. Comput. Oper. Res.25 (1998) 957–967.  
  15. 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. J. Appl. Prob.31 (1994) 476–496.  
  16. J. Li and N. Tian, The discrete-time GI/Geo/1 queue with working vacations and vacation interruption. Appl. Math. Comput.185 (2007) 1–10.  
  17. J. Medhi, Recent Developments in Bulk Queueing Models. Wiley Eastern Ltd. New Delhi (1984).  
  18. Mian Zhang and Zhengting Hou, Performance analysis of M/G/1 queue with working vacations and vacation interruption. J. Comput. Appl. Math.234 (2010) 2977–2985.  
  19. Mian Zhang and Zhengting Hou, Performance analysis of MAP/G/1 queue with working vacations and vacation interruption. Appl. Math. Modell.35 (2011) 1551–1560.  
  20. N. Limnios and Gheorghe Oprisan, Semi-Markov processes and reliability- Statistics for Industry and Technology Birkhauser Boston, Springer (2001).  
  21. H. Takagi, Queueing Analysis : A foundation of Performance Evaluation, Vacation and Priority Systems. North Holland, Amsterdam (1991), Vol. 1.  
  22. N. Tian and S.G. Zhang, Vacation Queueing Models : Theory and Applications. Springer, New York (2006).  
  23. Y. Baba, The M/PH/1 queue with working vacations and vacation interruption. J. Syst. Sci. Eng.19 (2010) 496–503. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.