Download presentation

Presentation is loading. Please wait.

Published byVictoria Pruiett Modified over 2 years ago

1
Branch and Bound Example

2
Initial lower bound Jrpd 1048 21212 33611 45510 Use 1 machine preemptive schedule as lower bound Job 2 has a lateness of 5, this is a lower bound on Lmax J1 4 J3 5 J4 J3 J2 10 15 17

3
Initial upper bound Jrpd 1048 21212 33611 45510 Find some schedule. Lmax is 7. J1 4 6 J4 J3 J2 12 17

4
Branch on First job *,*,*,* 3,*,*,* 4,*,*,* 2,*,*,* 1,*,*,* Lower bound 5 Upper bound 7 Pick one node to explore. Let’s choose the one with 2 first

5
Optimal Preemptive Schedule with job 2 first Jrpd 1048 21212 33611 45510 Best preemptive schedule with J2 first has Lmax of 7. The schedule is also non-preemptive, so we have upper and lower Bounds of 7 J1 3 7 J4 J3 J2 12 18 1

6
Explored node 2 *,*,*,* 3,*,*,* 4,*,*,* 2,*,*,* 1,*,*,* Lower bound 5 Upper bound 7 Pick one node to explore. Let’s choose the one with 4 next Lower bound 7 Upper bound 7

7
Optimal Preemptive Schedule with job 4 first Jrpd 1048 21212 33611 45510 Best preemptive schedule with J4 first has Lmax of 9. The schedule is also non-preemptive, so we have upper and lower Bounds of 9 PRUNE J1 1014 J4 J3 J2 22 520

8
Explored node 4 *,*,*,* 3,*,*,* 4,*,*,* 2,*,*,* 1,*,*,* Lower bound 5 Upper bound 7 Pick one node to explore. Let’s choose the one with 1 next We already know that the lower bound is 5 and is preemptive. Lower bound 9 Upper bound 9 Lower bound 7 Upper bound 7

9
Exploring node 1 1,*,*,* 1,4,*,* 1,3,*,* 1,2,*,*.

10
Optimal Preemptive Schedule with job 1 and 2 first Jrpd 1048 21212 33611 45510 Best preemptive schedule with J1, J2 first, has Lmax of 6 and Is non-preemptive J1 411 J4 J3 J2 617

11
Exploring node 1,2 1,*,*,* 1,4,*,* 1,3,*,* 1,2,*,*.let’s try node 1,3 next Lower bound 6 Upper bound 6

12
Optimal Preemptive Schedule with job 1 and 3 first Jrpd 1048 21212 33611 45510 Best preemptive schedule with J1, J2 first, has Lmax of 5 and Is non-preemptive J1 415 J4 J3 J2 1017

13
Exploring node 1,3 1,*,*,* 1,4,*,* 1,3,*,* 1,2,*,* We have found a schedule that matches the global lower bound and are done! Lower bound 6 Upper bound 6 Lower bound 5 Upper bound 5

14
summary *,*,*,* 3,*,*,* 4,*,*,* 2,*,*,* 1,*,*,* Lower bound 5 Upper bound 7. Lower bound 9 Upper bound 9 Lower bound 7 Upper bound 7 1,2,*,* 1,3,*,* 1,4,*,* Lower bound 6 Upper bound 6 Lower bound 5 Upper bound 5

Similar presentations

OK

0 Synchronization Problem Resource sharing –Requires mutual exclusion –Critical section A code section that should be executed mutually exclusively by.

0 Synchronization Problem Resource sharing –Requires mutual exclusion –Critical section A code section that should be executed mutually exclusively by.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on water our lifeline adoption Presenting ppt on ipad Ppt on bond length formula Download ppt on pulse code modulation tutorial Project ppt on introduction to business finance Ppt on power system operation and control Ppt on animal kingdom class 9 Ppt on summary writing exercises Ppt on latest technology inventions Ppt on national stock exchange in india