IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i04ns0217595914500298.html
   My bibliography  Save this article

Analysis Of Finite Capacity Queue With Negative Customers And Bunker For Ousted Customers Using Chebyshev And Gegenbauer Polynomials

Author

Listed:
  • ROSTISLAV V. RAZUMCHIK

    (Institute of Informatics Problems of the Russian Academy of Sciences, 44/2, Vavilova street, Moscow 119333, Russia)

Abstract

Consideration is given to the queueing system with incoming Poisson flows of regular and negative customers. Regular customers await service in buffer of finite size r. Each negative customer upon arrival pushes a regular customer out of the queue in buffer (if it is not empty) and moves it to another queue of finite capacity r (bunker). Customers from both queues are served according to exponential distribution with parameter μ, first-come, first-served discipline, but customers in bunker are served with relative priority. Using method based on Chebyshev and Gegenbauer polynomials the algorithm for computation of stationary blocking probabilities and joint probability distribution of the number of customers in buffer and bunker is obtained. Numerical example is provided.

Suggested Citation

  • Rostislav V. Razumchik, 2014. "Analysis Of Finite Capacity Queue With Negative Customers And Bunker For Ousted Customers Using Chebyshev And Gegenbauer Polynomials," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-21.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500298
    DOI: 10.1142/S0217595914500298
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500298
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500298?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chris Blondia, 2022. "Evaluation of the Waiting Time in a Finite Capacity Queue with Bursty Input and a Generalized Push-Out Strategy," Mathematics, MDPI, vol. 10(24), pages 1-12, December.

    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:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500298. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.