Use the SPT rule to construct a preemptive schedule for the following set of ind
ID: 3549818 • Letter: U
Question
Use the SPT rule to construct a preemptive schedule for the following set of independent jobs on 3 identical and parallel machines.
Ti
T1
T2
T3
T4
T5
T6
T7
T8
T9
T10
T11
T12
Pi
3
12
22
7
13
21
2
17
27
19
11
9
Machine 1 T7,T12,T5,T6
Machine 2 T1,T11,T8,T3
Machine 3 T4,T2,T10
0 1 2 3 4 5 6 7 8 9 10
T7
T12
T5
T6
T1
T11
T8
T3
T4
T2
T1
This is the answer I got. Wondering if I am right. Thanks for any help on this.
Ti
T1
T2
T3
T4
T5
T6
T7
T8
T9
T10
T11
T12
Pi
3
12
22
7
13
21
2
17
27
19
11
9
Explanation / Answer
process time machine
t1 3 m2
t2 12 m3
t3 22 m2
t4 7 m3
t5 13 m1
t6 21 m1
t7 2 m1
t8 17 m2
t9 27 m3
t10 19 m3
t11 11 m2
t12 9 m1
in SPT shortest process will execute first.
based on the above table.. 2 is the shortest process time having by t7.so m1 process t7. next small time is 3 processed by m2. and next small value processed by m3.again check for small time and m1 will execute that process. this continues..
m1,m2,m3 are machines
Machine 1 T7,T12,T5,T6
Machine 2 T1,T11,T8,T3
Machine 3 T4,T2,T10,T9
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.