TY - JOUR
T1 - The inherent robustness of closed-loop scheduling
AU - McAllister, Robert D.
AU - Rawlings, James B.
AU - Maravelias, Christos T.
N1 - Funding Information:
The authors gratefully acknowledge the financial support of the NSF through grant #2027091.
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/3
Y1 - 2022/3
N2 - In closed-loop or online scheduling the realization of uncertainty in plant operations is addressed in real-time though consistent and frequent reoptimization and rescheduling. Although some simulation studies have explored the robustness of closed-loop scheduling for specific case studies, there are no theoretical results addressing the robustness of closed-loop scheduling. In this paper, we present and justify an appropriate definition of robustness for closed-loop scheduling subject to large and infrequent disturbances such as breakdowns and delays. Assuming that a reasonable reference trajectory for the nominal system is available, we construct a novel terminal constraint and corresponding terminal cost for a general production scheduling problem. Through appropriate assumptions we establish that the proposed closed-loop scheduling algorithm is inherently robust to large, infrequent disturbances. We conclude with an example to illustrate the implications of this analysis. For this example, the proposed algorithm outperforms a typical online scheduling algorithm.
AB - In closed-loop or online scheduling the realization of uncertainty in plant operations is addressed in real-time though consistent and frequent reoptimization and rescheduling. Although some simulation studies have explored the robustness of closed-loop scheduling for specific case studies, there are no theoretical results addressing the robustness of closed-loop scheduling. In this paper, we present and justify an appropriate definition of robustness for closed-loop scheduling subject to large and infrequent disturbances such as breakdowns and delays. Assuming that a reasonable reference trajectory for the nominal system is available, we construct a novel terminal constraint and corresponding terminal cost for a general production scheduling problem. Through appropriate assumptions we establish that the proposed closed-loop scheduling algorithm is inherently robust to large, infrequent disturbances. We conclude with an example to illustrate the implications of this analysis. For this example, the proposed algorithm outperforms a typical online scheduling algorithm.
KW - Closed-loop properties
KW - Model predictive control
KW - Robustness
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=85123624933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85123624933&partnerID=8YFLogxK
U2 - 10.1016/j.compchemeng.2022.107678
DO - 10.1016/j.compchemeng.2022.107678
M3 - Article
AN - SCOPUS:85123624933
SN - 0098-1354
VL - 159
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
M1 - 107678
ER -