Online scheduling on a single machine with one restart for all jobs to minimize the weighted makespan
In this paper, we consider the online scheduling problem on a single machine to minimize the weighted makespan.In this problem, all jobs arrive over time and they are allowed to be restarted only once.For the general case Riding Helmets when the processing times of all jobs are arbitrary, we show that there is no online algorithm with a competitive