IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v18y2016i2d10.1007_s11009-014-9429-0.html
   My bibliography  Save this article

Analysis of B M A P/M S P/1 Queue

Author

Listed:
  • S. K. Samanta

    (Universidade de Lisboa)

  • M. L. Chaudhry

    (Royal Military College of Canada)

  • A. Pacheco

    (Universidade de Lisboa)

Abstract

The analysis for the B M A P/M S P/1 queueing system is based on roots of the associated characteristic equation of the vector-generating function of system-length distribution at random epoch. We obtain the steady-state system-length distributions at various epochs as well as of the actual sojourn-time distribution of an arbitrary customer in an arriving batch.

Suggested Citation

  • S. K. Samanta & M. L. Chaudhry & A. Pacheco, 2016. "Analysis of B M A P/M S P/1 Queue," Methodology and Computing in Applied Probability, Springer, vol. 18(2), pages 419-440, June.
    • Handle: RePEc:spr:metcap:v:18:y:2016:i:2:d:10.1007_s11009-014-9429-0
    DOI: 10.1007/s11009-014-9429-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-014-9429-0
    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/s11009-014-9429-0?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 N. Dudin & Valentina I. Klimenok, 1996. "Queueing system with passive servers," International Journal of Stochastic Analysis, Hindawi, vol. 9, pages 1-20, January.
    2. Mohan L. Chaudhry & Carl M. Harris & William G. Marchal, 1990. "Robustness of Rootfinding in Single-Server Queueing Models," INFORMS Journal on Computing, INFORMS, vol. 2(3), pages 273-286, August.
    3. Samanta, S.K. & Gupta, U.C. & Sharma, R.K., 2007. "Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations," European Journal of Operational Research, Elsevier, vol. 182(1), pages 321-339, October.
    Full references (including those not matched with items on IDEAS)

    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. Mohan L. Chaudhry & James J. Kim, 2016. "Analytically elegant and computationally efficient results in terms of roots for the $$GI^{X}/M/c$$ G I X / M / c queueing system," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 237-257, February.
    2. S. K. Samanta, 2020. "Waiting-time analysis of D-$${ BMAP}{/}G{/}1$$BMAP/G/1 queueing system," Annals of Operations Research, Springer, vol. 284(1), pages 401-413, January.
    3. Mohan Chaudhry & Veena Goswami, 2022. "The Geo / G a , Y /1/ N Queue Revisited," Mathematics, MDPI, vol. 10(17), pages 1-17, September.
    4. Miaomiao Yu & Yinghui Tang, 2022. "Analysis of a renewal batch arrival queue with a fault-tolerant server using shift operator method," Operational Research, Springer, vol. 22(3), pages 2831-2858, July.
    5. M. L. Chaudhry & Veena Goswami, 2019. "The Queue Geo/G/1/N + 1 Revisited," Methodology and Computing in Applied Probability, Springer, vol. 21(1), pages 155-168, March.
    6. M. L. Chaudhry, 1992. "Computing stationary queueing‐time distributions of GI/D/1 and GI/D/c queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(7), pages 975-996, December.
    7. J. S. H. van Leeuwaarden, 2006. "Delay Analysis for the Fixed-Cycle Traffic-Light Queue," Transportation Science, INFORMS, vol. 40(2), pages 189-199, May.
    8. Pinai Linwong* & Nei Kato* & Yoshiaki Nemoto*, 2004. "A Polynomial Factorization Approach for the Discrete Time GIX/>G/1/K Queue," Methodology and Computing in Applied Probability, Springer, vol. 6(3), pages 277-291, September.
    9. P. Patrick Wang, 1993. "Static and dynamic scheduling of customer arrivals to a single‐server system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 345-360, April.
    10. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    11. M. L. Chaudhry & Gagandeep Singh & U. C. Gupta, 2013. "A Simple and Complete Computational Analysis of MAP/R/1 Queue Using Roots," Methodology and Computing in Applied Probability, Springer, vol. 15(3), pages 563-582, September.
    12. M. L. Chaudhry & A. D. Banik & A. Pacheco, 2017. "A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\infty $$ M S P / 1 / ∞," Annals of Operations Research, Springer, vol. 252(1), pages 135-173, May.
    13. Mohan Chaudhry & Abhijit Datta Banik & Sitaram Barik & Veena Goswami, 2023. "A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input," Mathematics, MDPI, vol. 11(5), pages 1-26, February.
    14. 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.
    15. Le-Duc, Tho & de Koster, Rene M.B.M., 2007. "Travel time estimation and order batching in a 2-block warehouse," European Journal of Operational Research, Elsevier, vol. 176(1), pages 374-388, January.
    16. Nitin Kumar & U. C. Gupta, 2020. "Analysis of batch Bernoulli process subject to discrete-time renewal generated binomial catastrophes," Annals of Operations Research, Springer, vol. 287(1), pages 257-283, April.
    17. Yu, Miaomiao & Alfa, Attahiru Sule, 2015. "Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1, a, b)/1/N queue with batch-size-dependent service time," European Journal of Operational Research, Elsevier, vol. 244(1), pages 227-239.
    18. Hanukov, Gabi, 2022. "Improving efficiency of service systems by performing a part of the service without the customer's presence," European Journal of Operational Research, Elsevier, vol. 302(2), pages 606-620.
    19. Nitin Kumar & U. C. Gupta, 2020. "A Renewal Generated Geometric Catastrophe Model with Discrete-Time Markovian Arrival Process," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 1293-1324, September.

    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:metcap:v:18:y:2016:i:2:d:10.1007_s11009-014-9429-0. 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.