Minimizing Makespan on identical parallel machines
1 Let OPT denote the makespan of the optimal schedule and let LS denote the makespan of the list schedule. 2 Let Jl denote the job that determines the makespan in the List Scheduling algorithm, i.e., Jl is the job that ﬁnishes last. Let tl denote the start time of Jl. 3 Consider the m machines, before Jl was assigned. Clearly, all machines ...
DA: 73 PA: 93 MOZ Rank: 35