IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v283y2016icp108-119.html
   My bibliography  Save this article

Performance prediction of a discrete-time batch arrival retrial queue with Bernoulli feedback

Author

Listed:
  • Upadhyaya, Shweta

Abstract

This paper examines a discrete-time GeoX/G/1 retrial queue wherein the customer is feedback again to the head of the queue with some probability in case when he is unsatisfied with his service. This phenomenon is called as Bernoulli feedback. We consider that if the server is busy at the arrival epoch, the arriving customer either interrupts the customer in service to receive his own service with probability pα or joins the orbit with probability pα¯=p(1−α) or departs from the system completely with probability p¯=1−p. A customer under the above defined three situations is called as either preferred customer or repeated customer or impatient customer, respectively. On the other hand if the incoming customer finds the server idle, he starts his service immediately. The service time and retrial time are general distributed whereas batch size is geometric distributed. We use generating function method to derive expressions for system size, orbit size and other performance measures. Further we provide the continuous time equivalent of our model. Finally numerical results are given to show the effect of some critical system parameters on various performance measures.

Suggested Citation

  • Upadhyaya, Shweta, 2016. "Performance prediction of a discrete-time batch arrival retrial queue with Bernoulli feedback," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 108-119.
    • Handle: RePEc:eee:apmaco:v:283:y:2016:i:c:p:108-119
    DOI: 10.1016/j.amc.2016.02.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316301370
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.02.026?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. Torben Meisling, 1958. "Discrete-Time Queuing Theory," Operations Research, INFORMS, vol. 6(1), pages 96-105, 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. Hui-Yu Zhang & Qing-Xin Chen & James MacGregor Smith & Ning Mao & Ai-Lin Yu & Zhan-Tao Li, 2017. "Performance analysis of open general queuing networks with blocking and feedback," International Journal of Production Research, Taylor & Francis Journals, vol. 55(19), pages 5760-5781, October.

    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. I. Atencia & A. Pechinkin, 2013. "A discrete-time queueing system with optional LCFS discipline," Annals of Operations Research, Springer, vol. 202(1), pages 3-17, January.
    2. Sofian Clercq & Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2016. "Analysis of a discrete-time queue with time-limited overtake priority," Annals of Operations Research, Springer, vol. 238(1), pages 69-97, March.
    3. Sofian Clercq & Bart Steyaert & Sabine Wittevrongel & Herwig Bruneel, 2016. "Analysis of a discrete-time queue with time-limited overtake priority," Annals of Operations Research, Springer, vol. 238(1), pages 69-97, March.

    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:apmaco:v:283:y:2016:i:c:p:108-119. 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.