IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v39y2021i2p176-204.html
   My bibliography  Save this article

Buffer allocation in asynchronous serial production systems with Bernoulli machines during transients

Author

Listed:
  • Wenchong Chen
  • Hongwei Liu
  • Ershi Qi

Abstract

Some asynchronous production systems can never be truly balanced. This phenomenon demands the incorporation of asynchronism and unreliability in buffer allocation problems (BAPs). This paper reports a BAP in an asynchronous serial production system with Bernoulli machines. A profit-based integer programming model is formulated to maximise the throughput and minimise the buffer capacity simultaneously. Because the production run is finite in the current mass customisation environment, a transient analysis is used to estimate the system performance. Piecewise closed-form expressions are derived for a two-machine case based on Markovian structures. For M > 2 machine lines, an efficient recursive algorithm based on aggregation is developed. Considering the nonlinear characteristic of this BAP, a dynamic-objective particle swarm optimisation with neighbourhood searching is developed. This approach is verified by a case from an assembly plant. The results demonstrate that the programming method can increase the system profit by 1.85%.

Suggested Citation

  • Wenchong Chen & Hongwei Liu & Ershi Qi, 2021. "Buffer allocation in asynchronous serial production systems with Bernoulli machines during transients," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 39(2), pages 176-204.
  • Handle: RePEc:ids:ijisen:v:39:y:2021:i:2:p:176-204
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=118263
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijisen:v:39:y:2021:i:2:p:176-204. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    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.