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

Transient analysis and real-time control of geometric serial lines with residence time constraints

Author

Listed:
  • Feifan Wang
  • Feng Ju
  • Ningxuan Kang

Abstract

Residence time constraints are commonly seen in practical production systems, where the time that intermediate products spend in a buffer is limited within a certain range. Parts have to be scrapped or reworked if their maximum allowable residence time is exceeded, while they cannot be released downstream before the minimum required residence time is reached. Such dynamics impose additional complexity onto the production system analysis. In order to optimize the production performance in a timely manner, the transient behavior of the production system and a real-time control strategy need to be investigated. In this article, we develop a Markov chain model to analyze the transient behavior of a two-machine geometric serial line with constraints on both maximum allowable residence time and minimum required residence time being. Compared with the simulation, the proposed analytical method is shown to estimate the system’s transient performance with high accuracy. Structural properties are investigated based on the model to provide insights into the effects of residence time constraints and buffer capacity on system performance. An iterative learning algorithm is proposed to perform real-time controls, which improves the system performance by balancing the trade-off between the production rate and scrap rate. Specifically, a control policy derived from Markov Decision Processes is implemented as an initial control policy, and the Bayesian method is then applied to the run time data to improve the control policy.

Suggested Citation

  • Feifan Wang & Feng Ju & Ningxuan Kang, 2019. "Transient analysis and real-time control of geometric serial lines with residence time constraints," IISE Transactions, Taylor & Francis Journals, vol. 51(7), pages 709-728, July.
  • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:7:p:709-728
    DOI: 10.1080/24725854.2018.1511937
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2018.1511937?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:51:y:2019:i:7:p:709-728. 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.