IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v160y2008i1p19-2910.1007-s10479-007-0292-z.html
   My bibliography  Save this article

A factorization property for BMAP/G/1 vacation queues under variable service speed

Author

Listed:
  • Jung Baek
  • Ho Lee
  • Se Lee
  • Soohan Ahn

Abstract

This paper proposes a simple factorization principle that can be used efficiently and effectively to derive the vector generating function of the queue length at an arbitrary time of the BMAP/G/1/ queueing systems under variable service speed. We first prove the factorization property. Then we provide moments formula. Lastly we present some applications of the factorization principle. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Jung Baek & Ho Lee & Se Lee & Soohan Ahn, 2008. "A factorization property for BMAP/G/1 vacation queues under variable service speed," Annals of Operations Research, Springer, vol. 160(1), pages 19-29, April.
    • Handle: RePEc:spr:annopr:v:160:y:2008:i:1:p:19-29:10.1007/s10479-007-0292-z
    DOI: 10.1007/s10479-007-0292-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0292-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0292-z?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. Ho Woo Lee & Boo Yong Ahn, 2002. "Operational behavior of the MAP / G / 1 queue under N -policy with a single vacation and set-up," International Journal of Stochastic Analysis, Hindawi, vol. 15, pages 1-30, January.
    2. Peter Purdue, 1974. "The M / M /1 Queue in a Markovian Environment," Operations Research, INFORMS, vol. 22(3), pages 562-569, June.
    3. M. Eisen & M. Tainiter, 1963. "Stochastic Variations in Queuing Processes," Operations Research, INFORMS, vol. 11(6), pages 922-927, December.
    4. Uri Yechiali, 1973. "A Queuing-Type Birth-and-Death Process Defined on a Continuous-Time Markov Chain," Operations Research, INFORMS, vol. 21(2), pages 604-609, April.
    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. Jung Baek & Ho Lee & Se Lee & Soohan Ahn, 2013. "A MAP-modulated fluid flow model with multiple vacations," Annals of Operations Research, Springer, vol. 202(1), pages 19-34, January.
    2. Souvik Ghosh & A. D. Banik, 2018. "Computing conditional sojourn time of a randomly chosen tagged customer in a $$\textit{BMAP/MSP/}1$$ BMAP / MSP / 1 queue under random order service discipline," Annals of Operations Research, Springer, vol. 261(1), pages 185-206, February.
    3. Wojciech M. Kempa, 2016. "Transient workload distribution in the $$M/G/1$$ M / G / 1 finite-buffer queue with single and multiple vacations," Annals of Operations Research, Springer, vol. 239(2), pages 381-400, 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. Kuban Altinel, I. & Ozekici, Suleyman, 1998. "Optimum component test plans for systems with dependent components," European Journal of Operational Research, Elsevier, vol. 111(1), pages 175-186, November.
    2. Mayorga, Maria E. & Ahn, Hyun-Soo, 2011. "Joint management of capacity and inventory in make-to-stock production systems with multi-class demand," European Journal of Operational Research, Elsevier, vol. 212(2), pages 312-324, July.
    3. Jan-Pieter Dorsman & Kristen Gardner, 2024. "New directions in pass-and-swap queues," Queueing Systems: Theory and Applications, Springer, vol. 107(3), pages 205-256, September.
    4. Gabriel Zayas‐Cabán & Emmett J. Lodree & David L. Kaufman, 2020. "Optimal Control of Parallel Queues for Managing Volunteer Convergence," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2268-2288, October.
    5. Guodong Pang & Andrey Sarantsev & Yana Belopolskaya & Yuri Suhov, 2020. "Stationary distributions and convergence for M/M/1 queues in interactive random environment," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 357-392, April.
    6. H. Thorsdottir & I. M. Verloop, 2016. "Markov-modulated M/G/1-type queue in heavy traffic and its application to time-sharing disciplines," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 29-55, June.

    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:160:y:2008:i:1:p:19-29:10.1007/s10479-007-0292-z. 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.