Branch and Bound Example. Initial lower bound Jrpd 1048 21212 33611 45510 Use 1 machine preemptive schedule as lower bound Job 2 has a lateness of 5,

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Advertisements

Alphabet Matching Game A-G Instructions In each slide there is a Capital letter and four lower case letters. Choose the correct lower case letter that.
Price Of Anarchy: Routing
Lecture 6: Job Shop Scheduling Introduction
© J. Christopher Beck Lecture 7: Shifting Bottleneck.
0 Synchronization Problem Resource sharing –Requires mutual exclusion –Critical section A code section that should be executed mutually exclusively by.
EDA (CS286.5b) Day 10 Scheduling (Intro Branch-and-Bound)
Johnson’s Rule Johnson’s rule: A procedure that minimizes makespan when scheduling a group of jobs on two workstations. Step 1. Find the shortest processing.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 14: March 3, 2004 Scheduling Heuristics and Approximation.
Branch & Bound Algorithms
Lateness Models Contents
Route Planning Branch & Bound CIS548 November 15, 2006.
1 IOE/MFG 543 Chapter 3: Single machine models (Sections 3.1 and 3.2)
Min-Max Trees Based on slides by: Rob Powers Ian Gent Yishay Mansour.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
Ecole Polytechnique, Nov 11, List Scheduling on Related Machines processors Related machines: machines may have different speeds  0.25 
Ch 13 – Backtracking + Branch-and-Bound
Branch and Bound Algorithm for Solving Integer Linear Programming
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
1 IOE/MFG 543 Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
1 Contents college 3 en 4 Book: Appendix A.1, A.3, A.4, §3.4, §3.5, §4.1, §4.2, §4.4, §4.6 (not: §3.6 - §3.8, §4.2 - §4.3) Extra literature on resource.
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems Authors: M. Mezmaz, N. Melab and E-G. Talbi Presented.
Choose the right picture
Minimizing Makespan and Preemption Costs on a System of Uniform Machines Hadas Shachnai Bell Labs and The Technion IIT Tami Tamir Univ. of Washington Gerhard.
Integer programming Branch & bound algorithm ( B&B )
Job-shop Scheduling n jobs m machines No recirculation – Jobs do not revisit the same machine (i, j) is referred to as an operation in which job j is processed.
Branch & Bound UPPER =  LOWER = 0.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 12: February 13, 2002 Scheduling Heuristics and Approximation.
Creating a Box-and-Whisker Plot O To create your own box-and-whisker plot, you must first find the following values. Lowest Value Lower Quartile Median.
Exact methods for ALB ALB problem can be considered as a shortest path problem The complete graph need not be developed since one can stop as soon as in.
8.4 Solving Polynomial & Rational Inequalities
In this section, we investigate convergence of series that are not made up of only non- negative terms.
EXPLORING Mountains have slopes…. …and so do lines.
ETH Zurich – Distributed Computing – Klaus-Tycho Förster, Rijad Nuridini, Jara Uitto, Roger Wattenhofer Lower Bounds for the Capture.
© J. Christopher Beck Lecture 10: (Full) Shifting Bottleneck.
Parallel Machine Scheduling
Optimal Superblock Scheduling Using Enumeration Ghassan Shobaki, CS Dept. Kent Wilken, ECE Dept. University of California, Davis
Bounds Bingo!. Pick any 9 of these numbers
5-1 Copyright © 2013 Pearson Education Integer Programming: The Branch and Bound Method Module C.
Branch-and-Bound & Beam-Search. Branch and bound Enumeration in a search tree each node is a partial solution, i.e. a part of the solution space... root.
Prabhas Chongstitvatana 1 Backtracking Eight queens problem 1 try all possible C 64 8 = 4,426,165,368 2 never put more than one queen on a given row, vector.
Creating a Box-and-Whisker Plot O To create your own box-and-whisker plot, you must first find the following values. Lowest Value Lower Quartile Median.
Solving IPs – Implicit Enumeration Similar to Binary IP Branch and Bound General Idea: Fixed variables – those for which a value has been fixed. Free Variable.
Greedy Algorithms.
Lecture 11: Tree Search © J. Christopher Beck 2008.
Parallel Machines (Q||ΣCi , Q|pmtn|ΣCi , R||ΣCi , R|pmtn|Cmax, R|pmtn|Lmax) Lesson 8.
Load Balancing: List Scheduling
Turing Machine
CS137: Electronic Design Automation
Introduction to Operations Research
Heuristics Definition – a heuristic is an inexact algorithm that is based on intuitive and plausible arguments which are “likely” to lead to reasonable.
در تجزیه و تحلیل شغل باید به 3 سوال اساسی پاسخ دهیم Job analysis تعریف کارشکافی، مطالعه و ثبت جنبه های مشخص و اساسی هر یک از مشاغل عبارتست از مراحلی.
Branch and Bound.
10:00.
Compute convex lower bounding function and optimize it instead!
Graph Classification SEG 5010 Week 3.
Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Branch and Bound Example
Successive Shortest Path Algorithm
IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
Bounds Bingo!.
EMIS 8373: Integer Programming
List Scheduling Given a list of jobs (each with a specified processing time), assign them to processors to minimize makespan (max load) In Graham’s notation:
Load Balancing: List Scheduling
Branch & Bound Another technique for optimization, this time as an and-tree Guaranteed to provide the globally optimum solution to a problem, but may need.
Vehicle routing in Python
We have the following incomplete B&B tree:
Branch-and-Bound Algorithm for Integer Program
CS137: Electronic Design Automation
Presentation transcript:

Branch and Bound Example

Initial lower bound Jrpd 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 J

Initial upper bound Jrpd Find some schedule. Lmax is 7. J1 4 6 J4 J3 J

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

Optimal Preemptive Schedule with job 2 first Jrpd 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 J

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

Optimal Preemptive Schedule with job 4 first Jrpd 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 J J4 J3 J

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

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

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

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

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

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

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