+1 862 207 3288 Homework #2
(Due: 2/1 Class#9)
(Total: 50 points)
1. Give a full description of the scheduling problems denoted by the following | | notation shown below.
(a) 1 | prec | Cj
(b) P4 | Pj = 1, chains | Cmax
(c) Q | prmp, rj | Wj Cj
2. Use McNaughton’s wrap around rule to construct a preemptive schedule for the following set of independent jobs on 6 identical and
parallel machines.
Ti T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11
Pi 7 5 3 4 1 6 2 4 11 8 2
3. 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 7 15
2 18 13 21 22 25 12 9 11 3
4. Use Leung-Young algorithm to construct a preemptive schedule for the following jobs on 4 identical and parallel machines.
Ti T1 T2 T3 T4 T5 T6 T7 T8 T9 T10 T11 T12
Pi 1 2 3 4 6 7 9 11 12 16 20 20
TAKE ADVANTAGE OF OUR PROMOTIONAL DISCOUNT DISPLAYED ON THE WEBSITE AND GET A DISCOUNT FOR YOUR PAPER NOW!
