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

A queueing system with n-phases of service and (n-1)-types of retrial customers

Author

Listed:
  • Langaris, Christos
  • Dimitriou, Ioannis

Abstract

A queueing system with a single server providing n-phases of service in succession is considered. Every customer receives service in all phases. Arriving customers join a single ordinary queue, waiting to start the service procedure. When a customer completes his service in the ith phase he decides either to proceed to the next phase or to join the Ki retrial box (i=1,2,...,n-1), from where he repeats the demand for the (i+1)th phase of service after a random amount of time and independently to the other customers in the system. Every customer can join during his service procedure a number of retrial boxes before departs from the system. When at the moment that a customer, either departs from the system or joins a retrial box and so releases the server, there are no other customers waiting in the ordinary queue, then the server departs for a single vacation of an arbitrarily distributed length. The arrival process is assumed to be Poisson and all service times are arbitrarily distributed. For such a system, the mean number of customers in the ordinary queue and in each retrial box separately are obtained, and used to investigate numerically system performance.

Suggested Citation

  • Langaris, Christos & Dimitriou, Ioannis, 2010. "A queueing system with n-phases of service and (n-1)-types of retrial customers," European Journal of Operational Research, Elsevier, vol. 205(3), pages 638-649, September.
  • Handle: RePEc:eee:ejores:v:205:y:2010:i:3:p:638-649
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00042-1
    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. J. Artalejo, 1999. "A classified bibliography of research on retrial queues: Progress in 1990–1999," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 187-211, December.
    2. B. Kumar & A. Vijayakumar & D. Arivudainambi, 2002. "An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume," Annals of Operations Research, Springer, vol. 113(1), pages 61-79, July.
    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. K. Avrachenkov & E. Morozov & B. Steyaert, 2016. "Sufficient stability conditions for multi-class constant retrial rate systems," Queueing Systems: Theory and Applications, Springer, vol. 82(1), pages 149-171, February.
    2. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    3. 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.
    4. Murtuza Ali Abidini & Onno Boxma & Bara Kim & Jeongsim Kim & Jacques Resing, 2017. "Performance analysis of polling systems with retrials and glue periods," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 293-324, December.
    5. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    6. Dieter Fiems & Tuan Phung-Duc, 2019. "Light-traffic analysis of random access systems without collisions," Annals of Operations Research, Springer, vol. 277(2), pages 311-327, June.

    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. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    2. Samira Taleb & Amar Aissani, 2016. "Preventive maintenance in an unreliable M/G/1 retrial queue with persistent and impatient customers," Annals of Operations Research, Springer, vol. 247(1), pages 291-317, December.
    3. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    4. Sanga, Sudeep Singh & Jain, Madhu, 2019. "Cost optimization and ANFIS computing for admission control of M/M/1/K queue with general retrial times and discouragement," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    5. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    6. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.
    7. Gao, Shan & Wang, Jinting, 2014. "Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers," European Journal of Operational Research, Elsevier, vol. 236(2), pages 561-572.
    8. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    9. Kim, Chesoong & Klimenok, Valentina I. & Orlovsky, Dmitry S., 2008. "The BMAP/PH/N retrial queue with Markovian flow of breakdowns," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1057-1072, September.
    10. Efrosinin, Dmitry & Winkler, Anastasia, 2011. "Queueing system with a constant retrial rate, non-reliable server and threshold-based recovery," European Journal of Operational Research, Elsevier, vol. 210(3), pages 594-605, May.
    11. T. Deepak, 2015. "On a retrial queueing model with single/batch service and search of customers from the orbit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 493-520, July.
    12. Rami Atar & Anat Lev-Ari, 2018. "Optimizing buffer size for the retrial queue: two state space collapse results in heavy traffic," Queueing Systems: Theory and Applications, Springer, vol. 90(3), pages 225-255, December.
    13. Vladimir Anisimov & Jesus Artalejo, 2002. "Approximation of multiserver retrial queues by means of generalized truncated models," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 51-66, June.
    14. Ioannis Dimitriou, 2013. "A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 542-571, October.
    15. Sofiane Ouazine & Karim Abbas, 2016. "A functional approximation for retrial queues with two way communication," Annals of Operations Research, Springer, vol. 247(1), pages 211-227, December.
    16. Ning Zhao & Zhaotong Lian & Kan Wu, 2015. "Analysis of a MAP/PH/1 Queue with Discretionary Priority Based on Service Stages," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-22, December.
    17. V. Jailaxmi & R. Arumuganathan & M. Senthil Kumar, 2017. "Performance analysis of an M/G/1 retrial queue with general retrial time, modified M-vacations and collision," Operational Research, Springer, vol. 17(2), pages 649-667, July.
    18. I. Atencia & G. Bouza & P. Moreno, 2008. "An M [X] /G/1 retrial queue with server breakdowns and constant rate of repeated attempts," Annals of Operations Research, Springer, vol. 157(1), pages 225-243, January.
    19. Se Won Lee & Bara Kim & Jeongsim Kim, 2022. "Analysis of the waiting time distribution in M/G/1 retrial queues with two way communication," Annals of Operations Research, Springer, vol. 310(2), pages 505-518, March.
    20. Wee Meng Yeo & Xue-Ming Yuan & Joyce Mei Wan Low, 2017. "On $$M^{X}/G(M/H)/1$$ M X / G ( M / H ) / 1 retrial system with vacation: service helpline performance measurement," Annals of Operations Research, Springer, vol. 248(1), pages 553-578, January.

    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:205:y:2010:i:3:p:638-649. 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.