Single Machine Predictive Scheduling Using Inserted Idle Times

Abstract EN

A single machine predictive scheduling problem is considered.

The primary objective is to minimize the total completion times.

The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule.

The surrogate measure of predictability is chosen to evaluate the completion time deviations.

Both of the primary objective and predictability are optimized.

In order to absorb the effects of disruptions, the predictive schedule is generated by inserting idle times.

Right-shift rescheduling method is used as the rescheduling strategy.

Three methods are designed to construct predictive schedules.

The computational experiments show that these algorithms provide high predictability with minor sacrifices in shop performance.