IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v252y2017i1d10.1007_s10479-015-1901-x.html
   My bibliography  Save this article

Moments of losses during busy-periods of regular and nonpreemptive oscillating $$M^X/G/1/n$$ M X / G / 1 / n systems

Author

Listed:
  • Fátima Ferreira

    (Universidade de Trás-os-Montes e Alto Douro (UTAD))

  • António Pacheco

    (Universidade de Lisboa)

  • Helena Ribeiro

    (Instituto Politécnico de Leiria)

Abstract

This work addresses loss characteristics associated to busy-periods of regular and nonpreemptive oscillating $$M^X/G/1/n$$ M X / G / 1 / n systems. By taking advantage of the Markov regenerative structure of the number of customers in the system and resorting to results on moments of compound mixed Poisson distributions, it proposes a fast and easy to implement recursive procedure to compute integer moments of the number of customers lost in busy-periods initiated with multiple customers in the system.

Suggested Citation

  • Fátima Ferreira & António Pacheco & Helena Ribeiro, 2017. "Moments of losses during busy-periods of regular and nonpreemptive oscillating $$M^X/G/1/n$$ M X / G / 1 / n systems," Annals of Operations Research, Springer, vol. 252(1), pages 191-211, May.
    • Handle: RePEc:spr:annopr:v:252:y:2017:i:1:d:10.1007_s10479-015-1901-x
    DOI: 10.1007/s10479-015-1901-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1901-x
    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/s10479-015-1901-x?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. Vyacheslav M. Abramov, 2011. "Statistical Analysis of Single-server Loss Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 13(4), pages 763-781, December.
    2. Emil Bahary & Peter Kolesar, 1972. "Multilevel Bulk Service Queues," Operations Research, INFORMS, vol. 20(2), pages 406-420, April.
    3. Terrell J. Harris, 1971. "The Remaining Busy Period of a Finite Queue," Operations Research, INFORMS, vol. 19(1), pages 219-223, February.
    4. M. Yadin & P. Naor, 1967. "On queueing systems with variable service capacities," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(1), pages 43-53.
    5. Wang, Shaun & Sobrero, Monica, 1994. "Further Results on Hesselager's Recursive Procedure for Calculation of some Compound Distributions," ASTIN Bulletin, Cambridge University Press, vol. 24(2), pages 161-166, November.
    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. António Pacheco & Helena Ribeiro, 2008. "Consecutive customer losses in oscillating GI X /M//n systems with state dependent services rates," Annals of Operations Research, Springer, vol. 162(1), pages 143-158, September.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Gathy, Maude & Lefèvre, Claude, 2010. "On the Lagrangian Katz family of distributions as a claim frequency model," Insurance: Mathematics and Economics, Elsevier, vol. 47(1), pages 76-83, August.
    4. Terekhov, Daria & Christopher Beck, J., 2009. "An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers," European Journal of Operational Research, Elsevier, vol. 198(1), pages 223-231, October.
    5. Berman, Oded & Wang, Jiamin & Sapna, K. P., 2005. "Optimal management of cross-trained workers in services with negligible switching costs," European Journal of Operational Research, Elsevier, vol. 167(2), pages 349-369, December.
    6. Nasuh Buyukkaramikli & J. Bertrand & Henny Ooijen, 2013. "Flexible hiring in a make to order system with parallel processing units," Annals of Operations Research, Springer, vol. 209(1), pages 159-178, October.
    7. Alexander Zadorojniy & Guy Even & Adam Shwartz, 2009. "A Strongly Polynomial Algorithm for Controlled Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 992-1007, November.
    8. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.
    9. Sundt, Bjorn, 2002. "Recursive evaluation of aggregate claims distributions," Insurance: Mathematics and Economics, Elsevier, vol. 30(3), pages 297-322, June.
    10. Stefan Gerhold & Uwe Schmock & Richard Warnung, 2010. "A generalization of Panjer’s recursion and numerically stable risk aggregation," Finance and Stochastics, Springer, vol. 14(1), pages 81-128, January.
    11. J. R. Artalejo & A. Economou, 2005. "Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis," Methodology and Computing in Applied Probability, Springer, vol. 7(3), pages 353-378, September.
    12. Guy Even & Alexander Zadorojniy, 2012. "Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks," Annals of Operations Research, Springer, vol. 201(1), pages 159-167, December.

    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:annopr:v:252:y:2017:i:1:d:10.1007_s10479-015-1901-x. 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.