IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v182y2007i1p321-339.html
   My bibliography  Save this article

Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations

Author

Listed:
  • Samanta, S.K.
  • Gupta, U.C.
  • Sharma, R.K.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:182:y:2007:i:1:p:321-339
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00865-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Alfa, Attahiru Sule & Frigui, Imed, 1996. "Discrete NT-policy single server queue with Markovian arrival process and phase type service," European Journal of Operational Research, Elsevier, vol. 88(3), pages 599-613, February.
    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.

    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. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    2. Miaomiao Yu & Attahiru Sule Alfa, 2016. "Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue," Operational Research, Springer, vol. 16(2), pages 161-179, July.
    3. Imed Frigui & Attahiru Sule Alfa & Xiaoyi Xu, 1997. "Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 559-576, September.
    4. 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.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:182:y:2007:i:1:p:321-339. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.