Documente Academic
Documente Profesional
Documente Cultură
10
11
12
13
Machine 2
10
Machine 1
10
10
10
11
Machine 3
10
11
11
11
12
10
11
12
13
Cmax
Machine 2
Machine 1
Machine 3
1.#
In#
a#
particular#
workshop,#
machines.#
Their#
processing
Find#
a#
good#
solution#
for#
the
!
14
15
16
17
13
11
4
18
19
3
5
9
Use LPT found a good solution, and the minimum time is 34. (there are 13 job
cular#
workshop,#
10#
jobs#
run#
through#
three#
non9identical#
parallel#
#
Their#
processing#
times#
are#
as#
follows#
(0.4#
points):#
#
d#
solution#
for#
the#
minimum#
time#
that#
all#
the#
jobs#
can#
be#
completed#
20
21
22
23
24
25
26
27
28
6
1
29
30
31
32
10
12
33
34
Let LPT(I) be the maximum completion time obtained for instance I using algorithm LPT an
processing time for the job i. According to the LPT algorithm, the optimal schedule s
1 2m-1
m
m
2 2m-1
m-1
m-1
3 2m-2
m-2
m-2
So the LPT(I) = 2m-1+m+m
4 2m-2
m-3
m-3
m
Let the OPT(I) be the optimal maximum completion time for instance I, we can know
OPT(I)<=Sum(pi)/m. Sum(pi)=1/m *{2[2m*m-m(m+1)/2]+m}=1/m*[2(2m^2-m^2/2-m/
3m^2=3m
So the RA(I)=LPT(I)/OPT(I)=(4m-1)/3m=4/3-1/(3m)
-1/(3m)
Job
1
2
3
4
5
6
7
8
9
p
2
1
3
4
5
8
7
6
3
Sort
Job
2
1
3
9
4
5
8
7
6
p
1
2
3
3
4
5
6
7
8
a) SPT
M1
2
8
9
M2
1
4
M3
3
5
Cmax=16
1
2
3
4
5
6
7
8
9
b)LPT
M1
6
M2
7
4
M3
8
5
Cmax=14
1
2
3
4
5
6
7
8
9
c)Lower Bound = Sum(pi)/m= 39/3=13
d) I will use LPT
7
10
11
10
6
12 13
14
11
1
2
12 13
14
15
16
6
9
30
7
8
22
8
10
18
7
8
22
3
5
7
26
6
9
30
2
14
21
25
4
7
8
22
20
0
8
10
18
18
0
8
9
10
11
12
13
14
15
16
iness for
ibe how you
chines. Also
6
9
30
29
0
5
17
7
26
25
0
18 19
20
21
22
23
24
25
26
27
28
29