IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v261y2018i1d10.1007_s10479-017-2534-z.html
   My bibliography  Save this article

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

Author

Listed:
  • Souvik Ghosh

    (Indian Institute of Technology Bhubaneswar)

  • A. D. Banik

    (Indian Institute of Technology Bhubaneswar)

Abstract

This paper deals with the analysis of a single server queue with non-renewal batch arrival and non-renewal service, where the customers are selected randomly for service. The Laplace–Stieltjes transform of the waiting time distribution of a randomly chosen k-type ( $$k{\ge }1$$ k ≥ 1 ) customer, i.e., the customer who finds k ( $${\ge }1$$ ≥ 1 ) other customers in the system at his arrival epoch, is derived using matrix-analytic (RG-factorization) technique. The expression of the expected sojourn time of a k-type ( $$k\ge 0$$ k ≥ 0 ) customer is formulated. The detailed computational procedure along with the numerical results is presented in this paper. A comparison among the random order service (ROS), first-come first-serve, egalitarian processor sharing and generalized processor sharing discipline in terms of the expected sojourn time of a k-type ( $$k\ge 0$$ k ≥ 0 ) customer is presented in the numerical section. The present study indicates that the ROS discipline may be preferred over other scheduling policies for certain correlated arrival and/or service processes.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:261:y:2018:i:1:d:10.1007_s10479-017-2534-z
    DOI: 10.1007/s10479-017-2534-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2534-z
    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-017-2534-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. 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.
    2. Caulkins, Jonathan P., 2010. "Might randomization in queue discipline be useful when waiting cost is a concave function of waiting time?," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 19-24, March.
    3. L. Durr, 1971. "Priority Queues with Random Order of Service," Operations Research, INFORMS, vol. 19(2), pages 453-460, April.
    4. 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.
    5. Grace M. Carter & Robert B. Cooper, 1972. "Queues with Service in Random Order," Operations Research, INFORMS, vol. 20(2), pages 389-405, April.
    6. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.
    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. Sujit Kumar Samanta & Kousik Das, 2023. "Detailed Analytical and Computational Studies of D-BMAP/D-BMSP/1 Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-37, March.
    2. 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.

    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. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.
    2. Huh, Woonghee Tim & Lee, Jaywon & Park, Heesang & Park, Kun Soo, 2019. "The potty parity problem: Towards gender equality at restrooms in business facilities," Socio-Economic Planning Sciences, Elsevier, vol. 68(C).
    3. Jesus R. Artalejo & A. Gómez‐Corral, 2007. "Waiting time analysis of the M/G/1 queue with finite retrial group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 524-529, August.
    4. 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.
    5. 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.
    6. Hossein Abouee‐Mehrizi & Ata Ghareaghaji Zare & Renata A. Konrad, 2022. "Pricing in Service Systems with Rational Balking and Abandonment of Time‐Sensitive Customers," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 495-510, February.
    7. 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.
    8. Field, A. J. & Harrison, P. G., 1999. "Sojourn times in a random queue with and without preemption," European Journal of Operational Research, Elsevier, vol. 112(3), pages 646-653, February.

    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:261:y:2018:i:1:d:10.1007_s10479-017-2534-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.