1992 Volume 18 Issue 4 Pages 502-509
The rolling schedule algorithm includes the following operations. An optimal decision is formed by solving a multi-period optimization problem over a finite time horizon and implementing only the first period's decision. One period later, the multiperiod model is updated through measurements and the operation is repeated. The significance of the rolling schedule is accepted widely, but there have been few analytic studies of robustness in operational research because of the difficulty in description of the solution. This paper unveils some general properties of the rolling schedule for a simple case by using the digital control theory.