IDEAS home Printed from https://ideas.repec.org/a/wly/apsmda/v9y1993i2p111-125.html
   My bibliography  Save this article

Analysis of a closed‐loop manufacturing system with finite buffers

Author

Listed:
  • Abdellatif Bouhchouch
  • Yannick Frein
  • Yves Dallery

Abstract

In this paper, we are interested in the analysis of a closed loop manufacturing system with finite buffers. More precisely, the system we consider is a production line consisting of a series of machines separated by buffers of finite capacity. In addition, parts need to be mounted onto pallets during their processing through the production line. Our aim is to develop an analytical method for performance evaluation of this class of manufacturing systems. The main performance parameter of interest when designing such a system is the production capacity, i.e. the maximal production rate that can be obtained. It is a function of the processing times at the different machines, the buffer sizes, as well as the total number of pallets that are available. For this purpose, we model the system as a closed queuing network with finite capacity queues. We propose a new approximation method to calculate the performance of such queuing networks. The principle is to decompose the closed queuing network into a set of subsystems, each subsystem modelling the flow of material in one of the buffers of the network. The population constraint of the closed network is taken into account by ensuring that the sum of the average queue lengths of the different subsystems is equal to the number of the customers of the network. We present numerical results that show that the method has a fairly good qualitative as well as quantitative behaviour.

Suggested Citation

  • Abdellatif Bouhchouch & Yannick Frein & Yves Dallery, 1993. "Analysis of a closed‐loop manufacturing system with finite buffers," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 9(2), pages 111-125, June.
    • Handle: RePEc:wly:apsmda:v:9:y:1993:i:2:p:111-125
    DOI: 10.1002/asm.3150090205
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asm.3150090205
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asm.3150090205?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
    ---><---

    Citations

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


    Cited by:

    1. Arianna Alfieri & Andrea Matta & Giulia Pedrielli, 2015. "Mathematical programming models for joint simulation–optimization applied to closed queueing networks," Annals of Operations Research, Springer, vol. 231(1), pages 105-127, August.

    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:wly:apsmda:v:9:y:1993:i:2:p:111-125. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-0747 .

    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.