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

Table 2

The setup time of jobs.

𝑤(0,0;1,1)=9	𝑤(0,0;2,1)=6	𝑤(0,0;3,1)=3
𝑤(1,1;1,3)=3	𝑤(2,1;2,3)=2	𝑤(3,1;3,2)=2
𝑤(1,3;1,4)=3	𝑤(2,3;2,4)=2	𝑤(3,2;3,3)=1
𝑤(1,4;1,5)=3	𝑤(2,4;2,5)=2	𝑤(3,3;3,6)=1
𝑤(1,5;1,6)=3	𝑤(2,5;2,6)=2	𝑤(2,2;3,3)=1
𝑤(1,6;1,9)=8	𝑤(0,0;2,2)=4	𝑤(3,3;3,5)=1
𝑤(0,0;1,2)=6	𝑤(1,2;1,7)=1	𝑤(3,5;1,8)=1
𝑤(∗,∗;∗,∗) = 0 for other jobs.