TY - JOUR
T1 - Transient analysis and real-time control of geometric serial lines with residence time constraints
AU - Wang, Feifan
AU - Ju, Feng
AU - Kang, Ningxuan
N1 - Funding Information:
The authors would like to thank David Berman, José Edelstein, Prem Kumar, Carlos Núñez, Alfonso Ramallo, Konstantin Savvidy, James Sparks and Steffan Theissen for interesting and helpful conversations. R. P. would like to acknowledge the generous support to Centro de Estudios Cientificos (CECS) by Empresas CMPC. CECS is a Millenium Science Institute and is funded in part by grants from Fundación Andes and the Tinker Foundation.
Publisher Copyright:
© 2018, © 2018 “ISE”.
PY - 2019/7/3
Y1 - 2019/7/3
N2 - 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.
AB - 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.
KW - Transient analysis
KW - geometric serial lines
KW - real-time control
KW - residence time constraints
UR - http://www.scopus.com/inward/record.url?scp=85059549618&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059549618&partnerID=8YFLogxK
U2 - 10.1080/24725854.2018.1511937
DO - 10.1080/24725854.2018.1511937
M3 - Article
AN - SCOPUS:85059549618
SN - 2472-5854
VL - 51
SP - 709
EP - 728
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 7
ER -