IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v87y1999i0p247-26110.1023-a1018933003046.html
   My bibliography  Save this article

A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking

Author

Listed:
  • N. Asadathorn
  • X. Chao

Abstract

The throughputs of assembly and disassembly queueing networks with finite buffer and blocking are difficult to evaluate due to their large state space. In this paper, we present an approximation technique to analyze such a system with Poisson arrivals and exponential service times. It decomposes the system into multiple two‐server queues with unlimited input and an assembly or disassembly station with one buffer. The decomposed individual stations are then aggregated and coupled with their input parameters determined by the solution of a set of nonlinear equations which could be effectively calculated through an iterative algorithm. The results are compared with simulations, and the errors are found to be within 10% in all tested cases. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • N. Asadathorn & X. Chao, 1999. "A decomposition approximation for assembly‐disassembly queueing networkswith finite buffer and blocking," Annals of Operations Research, Springer, vol. 87(0), pages 247-261, April.
    • Handle: RePEc:spr:annopr:v:87:y:1999:i:0:p:247-261:10.1023/a:1018933003046
    DOI: 10.1023/A:1018933003046
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018933003046
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018933003046?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. Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.

    More about this item

    Statistics

    Access and download statistics

    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:87:y:1999:i:0:p:247-261:10.1023/a:1018933003046. 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: 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.