The 𝐶^max Problem of Scheduling Multiple Groups of Jobs on Multiple Processors at Different Speeds

Table 3

The improved LS schedule.

Processors	Processing times of jobs						𝑀𝑇𝑖
Processor 1 (𝑠1=3)	𝑡(1,1)=9	𝑡(1,4)=3	𝑡(1,6)=3	𝑡(1,9)=8			92/3
Processor 2 (𝑠2=2)	𝑡(2,1)=6	𝑡(2,3)=2	𝑡(2,4)=2	𝑡(2,6)=2			18
Processor 3 (𝑠3=1)	𝑡(3,1)=3	𝑡(3,2)=2	𝑡(3,3)=1	𝑡(3,4)=1	𝑡(3,5)=1	𝑡(3,6)=1	18
Processor 4 (𝑠4=1)	𝑡(1,2)=6	𝑡(1,5)=3	𝑡(1,7)=1				20
Processor 5 (𝑠5=1)	𝑡(2,2)=4	𝑡(1,3)=3	𝑡(2,5)=2	𝑡(1,8)=1			20