IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v50y2018i3p143-160.html
   My bibliography  Save this article

Analysis of closed-loop production lines with Bernoulli reliability machines: Theory and application

Author

Listed:
  • Yuan Feng
  • Xiang Zhong
  • Jingshan Li
  • Wenhui Fan

Abstract

In this article, an iteration approach is introduced to study closed-loop production lines with a constant number of carriers. A Bernoulli machine reliability model is assumed. The closed-loop system is decomposed into multiple small loop lines and further down to two-machine loops, in which the distributions of carriers are derived. Then an iteration procedure is presented to estimate the interactions between the small loops to modify the carrier distributions. Upon convergence, the system production rate can be estimated using these distributions. The convergence of the procedure is proved analytically, and the accuracy of estimation is justified numerically. It is shown that the method has good accuracy and computational efficiency. In addition, a case study at an automotive assembly plant is introduced to illustrate the applicability of the method.

Suggested Citation

  • Yuan Feng & Xiang Zhong & Jingshan Li & Wenhui Fan, 2018. "Analysis of closed-loop production lines with Bernoulli reliability machines: Theory and application," IISE Transactions, Taylor & Francis Journals, vol. 50(3), pages 143-160, March.
  • Handle: RePEc:taf:uiiexx:v:50:y:2018:i:3:p:143-160
    DOI: 10.1080/24725854.2017.1299957
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2017.1299957
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2017.1299957?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. N. Maggio & A. Matta & S. Gershwin & T. Tolio, 2009. "A decomposition approximation for three-machine closed-loop production systems with unreliable machines, finite buffers and a fixed population," IISE Transactions, Taylor & Francis Journals, vol. 41(6), pages 562-574.
    2. Svenja Lagershausen & Michael Manitz & Horst Tempelmeier, 2013. "Performance analysis of closed-loop assembly lines with general processing times and finite buffer spaces," IISE Transactions, Taylor & Francis Journals, vol. 45(5), pages 502-515.
    Full references (including those not matched with items on IDEAS)

    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. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    2. Michael Manitz, 2015. "Analysis of assembly/disassembly queueing networks with blocking after service and general service times," Annals of Operations Research, Springer, vol. 226(1), pages 417-441, March.
    3. Zhang, Yongjin & Zhao, Ming & Zhang, Yanjun & Pan, Ruilin & Cai, Jing, 2020. "Dynamic and steady-state performance analysis for multi-state repairable reconfigurable manufacturing systems with buffers," European Journal of Operational Research, Elsevier, vol. 283(2), pages 491-510.
    4. Stefan Helber & Ton Kok & Heinrich Kuhn & Michael Manitz & Andrea Matta & Raik Stolletz, 2019. "Quantitative approaches in production management," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft fĂĽr Operations Research e.V., vol. 41(4), pages 867-870, December.
    5. 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:taf:uiiexx:v:50:y:2018:i:3:p:143-160. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.