IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v53y2016i3d10.1007_s12597-015-0244-3.html
   My bibliography  Save this article

Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server’s vacation

Author

Listed:
  • K. Sikdar

    (BMS Institute of Technology & Management
    Visvesvaraya Technological University (VTU))

  • S. K. Samanta

    (National Institute of Technology)

Abstract

In this article, we study a finite buffer single server variable batch service queue where customers arrive according to a batch Markovian arrival process. The server serves the customers with a variable batch size at the starting point of services. When all the customers are served in the system exhaustively, the server leaves for a vacation. Single as well as multiple vacation policies are analyzed. We derive the queue length distributions at different epochs. Some important performance measures such as blocking probabilities, mean queue lengths, mean waiting time have been obtained. A variety of computational results are presented for practitioners and others who would like to check their results with those of ours.

Suggested Citation

  • K. Sikdar & S. K. Samanta, 2016. "Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server’s vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 553-583, September.
  • Handle: RePEc:spr:opsear:v:53:y:2016:i:3:d:10.1007_s12597-015-0244-3
    DOI: 10.1007/s12597-015-0244-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-015-0244-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12597-015-0244-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alexander Dudin & Srinivas Chakravarthy, 2002. "Optimal Hysteretic Control for the BMAP/G/ 1 System with Single and Group Service Modes," Annals of Operations Research, Springer, vol. 112(1), pages 153-169, April.
    2. Madhu Jain & Shweta Upadhyaya, 2010. "Optimal repairable M x /G/1 queue with multi-optional services and Bernoulli vacation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(1), pages 109-132.
    3. Warren B. Powell & Pierre Humblet, 1986. "The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure," Operations Research, INFORMS, vol. 34(2), pages 267-275, April.
    4. Gautam Choudhury & Kailash C. Madan, 2007. "A batch arrival Bernoulli vacation queue with a random setup time under restricted admissibility policy," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 2(1), pages 81-97.
    5. Winfried K. Grassmann & Michael I. Taksar & Daniel P. Heyman, 1985. "Regenerative Analysis and Steady State Distributions for Markov Chains," Operations Research, INFORMS, vol. 33(5), pages 1107-1116, October.
    6. K. Sikdar & U.C. Gupta & R.K. Sharma, 2008. "The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 3(1/2), pages 219-234.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yera Mora, Yoel Gustavo & Lillo Rodríguez, Rosa Elvira & Ramírez-Cobo, Pepa, 2017. "Findings about the two-state BMMPP for modeling point processes in reliability and queueing systems," DES - Working Papers. Statistics and Econometrics. WS 24622, Universidad Carlos III de Madrid. Departamento de Estadística.
    2. Khamis A. K. ALMaqbali & Varghese C. Joshua & Achyutha Krishnamoorthy, 2023. "Multi-Class, Multi-Server Queueing Inventory System with Batch Service," Mathematics, MDPI, vol. 11(4), pages 1-29, February.
    3. G. K. Tamrakar & A. Banerjee, 2020. "On steady-state joint distribution of an infinite buffer batch service Poisson queue with single and multiple vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1337-1373, December.
    4. Yera, Yoel G. & Lillo, Rosa E. & Ramírez-Cobo, Pepa, 2019. "Fitting procedure for the two-state Batch Markov modulated Poisson process," European Journal of Operational Research, Elsevier, vol. 279(1), pages 79-92.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Abhijit Datta Banik & Souvik Ghosh & M. L. Chaudhry, 2020. "On the optimal control of loss probability and profit in a GI/C-BMSP/1/N queueing system," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 144-162, March.
    2. Pala, Ali & Zhuang, Jun, 2018. "Security screening queues with impatient applicants: A new model with a case study," European Journal of Operational Research, Elsevier, vol. 265(3), pages 919-930.
    3. Sergei Dudin & Olga Dudina, 2023. "Analysis of a Multi-Server Queue with Group Service and Service Time Dependent on the Size of a Group as a Model of a Delivery System," Mathematics, MDPI, vol. 11(22), pages 1-20, November.
    4. Tijms, H.C. & Coevering, M.C.T. van de, 1990. "How to solve numerically the equilibrium equations of a Markov chain with infinitely many states," Serie Research Memoranda 0046, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    5. S. K. Samanta & R. Nandi, 2021. "Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP (a,b) / 1 / ∞ $^{\text {(a,b)}}/1/\infty $ Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1461-1488, December.
    6. Noah Gans & Garrett van Ryzin, 1999. "Dynamic Vehicle Dispatching: Optimal Heavy Traffic Performance and Practical Insights," Operations Research, INFORMS, vol. 47(5), pages 675-692, October.
    7. A. Banik & U. Gupta, 2007. "Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 146-160, July.
    8. A. D. Banik & M. L. Chaudhry, 2017. "Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP / G /1/ N With or Without Vacation(s)," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 140-151, February.
    9. Pekergin, Nihal & Dayar, Tugrul & Alparslan, Denizhan N., 2005. "Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering," European Journal of Operational Research, Elsevier, vol. 165(3), pages 810-825, September.
    10. Papadaki, Katerina P. & Powell, Warren B., 2002. "Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem," European Journal of Operational Research, Elsevier, vol. 142(1), pages 108-127, October.
    11. V. Ramaswami & David Poole & Soohan Ahn & Simon Byers & Alan Kaplan, 2005. "Ensuring Access to Emergency Services in the Presence of Long Internet Dial-Up Calls," Interfaces, INFORMS, vol. 35(5), pages 411-422, October.
    12. Kao, Edward P. C. & Wilson, Sandra D., 1999. "Analysis of nonpreemptive priority queues with multiple servers and two priority classes," European Journal of Operational Research, Elsevier, vol. 118(1), pages 181-193, October.
    13. Yi, Xeung W. & Kim, Nam K. & Yoon, Bong K. & Chae, Kyung C., 2007. "Analysis of the queue-length distribution for the discrete-time batch-service Geo/Ga,Y/1/K queue," European Journal of Operational Research, Elsevier, vol. 181(2), pages 787-792, September.
    14. Amod J. Basnet & Isaac M. Sonin, 2022. "Parallel computing for Markov chains with islands and ports," Annals of Operations Research, Springer, vol. 317(2), pages 335-352, October.
    15. Jewgeni H. Dshalalow & Ahmed Merie & Ryan T. White, 2020. "Fluctuation Analysis in Parallel Queues with Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 295-327, March.
    16. Xu, Jianjun & Serrano, Alejandro & Lin, Bing, 2017. "Optimal production and rationing policy of two-stage tandem production system," International Journal of Production Economics, Elsevier, vol. 185(C), pages 100-112.
    17. Katerina P. Papadaki & Warren B. Powell, 2003. "An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 742-769, October.
    18. Apoorv Saxena & Dieter Claeys & Bo Zhang & Joris Walraevens, 2020. "Cloud data storage: a queueing model with thresholds," Annals of Operations Research, Springer, vol. 293(1), pages 295-315, October.
    19. M. A. A. Boon & A. J. E. M. Janssen & J. S. H. Leeuwaarden & R. W. Timmerman, 2019. "Pollaczek contour integrals for the fixed-cycle traffic-light queue," Queueing Systems: Theory and Applications, Springer, vol. 91(1), pages 89-111, February.
    20. Dieter Claeys & Koenraad Laevens & Joris Walraevens & Herwig Bruneel, 2010. "Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(1), pages 1-23, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:opsear:v:53:y:2016:i:3:d:10.1007_s12597-015-0244-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.