IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v143y2006i1p277-29610.1007-s10479-006-7388-8.html
   My bibliography  Save this article

Some results on a generalized M/G/1 feedback queue with negative customers

Author

Listed:
  • B. Kumar
  • D. Arivudainambi
  • A. Krishnamoorthy

Abstract

This paper deals with a generalized M/G/1 feedback queue in which customers are either “positive" or “negative". We assume that the service time distribution of a positive customer who initiates a busy period is G e (x) and all subsequent positive customers in the same busy period have service time drawn independently from the distribution G b (x). The server is idle until a random number N of positive customers accumulate in the queue. Following the arrival of the N-th positive customer, the server serves exhaustively the positive customers in the queue and then a new idle period commences. This queueing system is a generalization of the conventional N-policy queue with N a constant number. Explicit expressions for the probability generating function and mean of the system size of positive customers are obtained under steady-state condition. Various vacation models are discussed as special cases. The effects of various parameters on the mean system size and the probability that the system is empty are also analysed numerically. Copyright Springer Science + Business Media, Inc. 2006

Suggested Citation

  • B. Kumar & D. Arivudainambi & A. Krishnamoorthy, 2006. "Some results on a generalized M/G/1 feedback queue with negative customers," Annals of Operations Research, Springer, vol. 143(1), pages 277-296, March.
    • Handle: RePEc:spr:annopr:v:143:y:2006:i:1:p:277-296:10.1007/s10479-006-7388-8
    DOI: 10.1007/s10479-006-7388-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-7388-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-7388-8?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. Michel Scholl & Leonard Kleinrock, 1983. "On the M / G /1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines," Operations Research, INFORMS, vol. 31(4), pages 705-719, August.
    2. Yonatan Levy & Uri Yechiali, 1975. "Utilization of Idle Time in an M/G/1 Queueing System," Management Science, INFORMS, vol. 22(2), pages 202-211, October.
    3. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    4. Offer Kella, 1989. "The threshold policy in the M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 111-123, February.
    5. Hyo-Seong Lee & Mandyam M. Srinivasan, 1989. "Control Policies for the M X /G/1 Queueing System," Management Science, INFORMS, vol. 35(6), pages 708-721, June.
    6. Hanoch Levy & Leonard Kleinrock, 1986. "A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition," Operations Research, INFORMS, vol. 34(3), pages 426-436, June.
    7. Teghem, J., 1986. "Control of the service process in a queueing system," European Journal of Operational Research, Elsevier, vol. 23(2), pages 141-158, February.
    8. Artalejo, J. R., 2000. "G-networks: A versatile approach for work removal in queueing networks," European Journal of Operational Research, Elsevier, vol. 126(2), pages 233-249, October.
    9. Wei Chang, 1968. "Queues with Feedback for Time-Sharing Computer System Analysis," Operations Research, INFORMS, vol. 16(3), pages 613-627, June.
    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. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.

    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. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    2. Offer Kella & Uri Yechiali, 1988. "Priorities in M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 23-34, February.
    3. B. Krishna Kumar & S. Pavai Madheswari & S. Anantha Lakshmi, 2011. "Queuing system with state-dependent controlled batch arrivals and server under maintenance," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 351-379, December.
    4. Jau-Chuan Ke, 2006. "An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(2), pages 357-369, May.
    5. Atencia, I., 2017. "A Geo/G/1 retrial queueing system with priority services," European Journal of Operational Research, Elsevier, vol. 256(1), pages 178-186.
    6. Zhang, Zhe G. & Tian, Naishuo, 2004. "An analysis of queueing systems with multi-task servers," European Journal of Operational Research, Elsevier, vol. 156(2), pages 375-389, July.
    7. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    8. Shweta Upadhyaya, 2020. "Investigating a general service retrial queue with damaging and licensed units: an application in local area networks," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 716-745, September.
    9. Lotfi Tadj & Gautam Choudhury, 2005. "Optimal design and control of queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 359-412, December.
    10. P. H. Brill & C. M. Harris, 1992. "Waiting times for M/G/1 queues with service‐time or delay‐dependent server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 775-787, October.
    11. Ivan Atencia & José Luis Galán-García, 2021. "Sojourn Times in a Queueing System with Breakdowns and General Retrial Times," Mathematics, MDPI, vol. 9(22), pages 1-25, November.
    12. R. E. Lillo, 2000. "Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model," Methodology and Computing in Applied Probability, Springer, vol. 2(2), pages 153-167, August.
    13. Tian, Naishuo & Zhang, Zhe George, 2006. "A two threshold vacation policy in multiserver queueing systems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 153-163, January.
    14. G. K. Tamrakar & A. Banerjee, 2020. "On steady-state joint distribution of an infinite buffer batch service Poisson queue with single and multiple vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1337-1373, December.
    15. Wu-Lin Chen, 2019. "Computing the Moments of Polling Models with Batch Poisson Arrivals by Transform Inversion," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 515-526, July.
    16. 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.
    17. Offer Kella, 1989. "The threshold policy in the M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 111-123, February.
    18. J. George Shanthikumar, 1989. "Level crossing analysis of priority queues and a conservation identity for vacation models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(6), pages 797-806, December.
    19. Jacob K. Daniel & R. Ramanarayanan, 1988. "An (s,S) inventory system with rest periods to the server," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 119-123, February.
    20. A Rodrigo & M Vazquez & C Carrera, 2006. "Markovian networks in labour markets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 526-531, May.

    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:143:y:2006:i:1:p:277-296:10.1007/s10479-006-7388-8. 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.