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

Fast algorithm for predicting the production process performance in flexible production lines with delayed differentiation

Author

Listed:
  • Jingchuan Chen
  • Zuo-Jun Max Shen

Abstract

In flexible manufacturing lines with delayed differentiation, the production process may fluctuate sharply when a control action is performed. As a result, the steady-state analysis algorithm is inaccurate for these production lines, and transient behavior studies have become crucial. However, dynamic analysis remains unexplored compared with the well-established theoretical system of steady-state analysis. Therefore, in this study, we propose a fast algorithm for predicting the production process performance in the delayed differentiation-based flexible production line under operation control. We first formulate practical problems existing in the auto, food, and furniture industries into a mathematical formation. Then, we offer closed-form formulae for predicting the production process performance using the built stochastic model in the production line with three machines. We also propose an algorithm to predict the performance of a production line having more than three machines. The proposed methods were verified to be highly accurate through comparison experiments. In terms of theoretical contributions, this study offers a research foundation for other transient-based studies. From a practical perspective, the proposed algorithms can be employed to predict the production process performance of processing lines under production control in advance.

Suggested Citation

  • Jingchuan Chen & Zuo-Jun Max Shen, 2024. "Fast algorithm for predicting the production process performance in flexible production lines with delayed differentiation," IISE Transactions, Taylor & Francis Journals, vol. 56(9), pages 932-944, September.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:9:p:932-944
    DOI: 10.1080/24725854.2022.2126564
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2022.2126564?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.

    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:56:y:2024:i:9:p:932-944. 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: 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.