Quality vs. performance in lookahead scheduling

We consider the use of lookahead to minimize the average wait time when scheduling jobs on a sin-gle machine. We compare the relationship be-tween quantity of lookahead and quality of sched-ule. Our results indicate that while we do gain further improvement with more lookahead, the amount of improvement drastically decreases be-yond Lookahead-1. Further, the time required for each scheduling decision increases with the size of the lookahead. We conclude that Lookahead-1 of-fers the best balance between quality of schedule and performance of the scheduler