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

A Finite Capacity Resequencing Model With Markovian Arrivals

Author

Listed:
  • SRINIVAS R. CHAKRAVARTHY

    (Department of Industrial and Manufacturing Engineering, Kettering University, Flint, MI 48504, USA)

  • STEFANKA CHUKOVA

    (School of Mathematical and Computing Sciences, Victoria University of Wellington, Wellington, New Zealand)

Abstract

In this paper, we consider a two-server finite capacity queuing model in which messages should leave the system in the order in which they entered the system. Messages arrive according to a Markovian arrival process (MAP) and any message finding the buffer full is considered lost. Out-of-sequence messages are stored in a (finite) buffer and may lead to blocking when a processed message cannot be placed in the buffer. The steady state analysis of the model is performed by exploiting the structure of the coefficient matrices. The departure process is characterized and two interesting optimization problems along with illustrative numerical examples are discussed.

Suggested Citation

  • Srinivas R. Chakravarthy & Stefanka Chukova, 2005. "A Finite Capacity Resequencing Model With Markovian Arrivals," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(03), pages 409-443.
    • Handle: RePEc:wsi:apjorx:v:22:y:2005:i:03:n:s0217595905000613
    DOI: 10.1142/S0217595905000613
    as

    Download full text from publisher

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

    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:22:y:2005:i:03:n:s0217595905000613. 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.