The Application of Predictive Scheduling Algorithms for Single Machine Problem

In this paper, we apply the predictive control theory into a classic scheduling problem and propose one single-step predictive scheduling algorithm. The performance of it is analyzed thoroughly and the lower bound of it is proved to be 2, which is the same as that of online algorithm. That is, in worst cases even the single-step predictive scheduling cannot perform better than online scheduling. However, with regarding to the more general instances, single-step scheduling outperforms online scheduling because it takes more future changes into consideration. This result is testified by the simulation.