Consider the following pair of equations as an alternative to Equation (9.3):

Where Ubound and Lbound are pre-chosen upper and lower bounds on the estimated value of T. The value of Xn + 1 is used in the shortest-process-next algorithm, instead of the value of Sn + 1. What functions do a and b perform, and what is the effect of higher and lower values on each?

Transcribed Image Text:

Xn+1 min [Ubound, max [Lbound, (BSn+1)1]