Predictive Scheduling for a Single Machine with Random Machine Breakdowns

We investigate a predictive scheduling problem to minimize the total completion times with random machine breakdowns. The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule. We provide three algorithms to construct predictive schedules. The computational experiments show that these algorithms provide high predictability with minor sacrifices in shop performance. The feedback algorithm has advantages in both predictability and shop performance.