Page
%P
-
Chapter and Conference Paper
Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines
In previous study on comparing the makespan of the schedule allowed to be preempted at most i times and that of the optimal schedule with unlimited number of preemptions, the worst case ratio was usually obtained...
-
Chapter and Conference Paper
Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information
In semi-online scheduling problems, we always assume that some partial additional information is exactly known in advance. This may not be true in some application. This paper considers semi-online problems on...