Download presentation

Presentation is loading. Please wait.

Published byMina Caron Modified over 2 years ago

1
Evaluating Heuristics for the Fixed-Predecessor Subproblem of Pm | prec, p j = 1 | C max

2
Outline 1.Introduction 2.Approach 3.CP and LNS heuristics 4.HLF heuristics 5.Numerical results

3
Pm | prec, p j = 1 | C max Problem: find the makespan-minimizing schedule for a set of unit- length jobs with arbitrary precedence constraints Efficient algorithms exist for m = 2 Unknown complexity for fixed m >= 3

4
Question Can we discover anything by restricting to subproblems with more structured precedence constraints? Are any approaches we know optimal for these subproblems?

5
Motivation If a subproblem is found to be easy: More information about boundary between easy and hard problems Can easily schedule such instances in real world If a subproblem is found to be hard: General case is also hard, resolving open problem Easier to reason about a problem with more structure

6
Subproblems We saw two such subproblems in class: In-tree Out-tree

7
Heuristics Critical path (CP), largest number of successors (LNS) optimal In-tree Out-tree

8
Heuristics Critical path: prioritize nodes at the head of the longest path of jobs that still need to run Largest number of successors: prioritize nodes which are a predecessor (direct or indirect) of the most nodes

9
Generalization Can we find other precedence structures for which these heuristics are optimal?

10
Generalization In-tree: each node has one successor Out-tree: each node has one predecessor Both are planar In-tree Out-tree

11
Generalization Generalize out-tree: allow arbitrary number K of predecessors per node Pictured: K = 3

12
Method Generate many instance with the K-predecessor structure Solve each instance with each algorithm, several times

13
Method Generate many instance with the K-predecessor structure Solve each instance with each algorithm, several times If algorithm performs worse than another algorithm on an instance, cannot be optimal If algorithm’s schedule differs in makespan across trials, algorithm cannot be optimal

14
Instance Generation Add K root nodes to the graph Iteratively add nodes, randomly choosing K predecessors each time Any valid instance has a chance to be generated using this algorithm

15
Results: CP and LNS Neither CP nor LNS is optimal for the K-predecessor problem On some instances, both result in inconsistent C max

16
Results: CP Both algorithms fail on this graph. Here are the CP schedules: Time1234 Machine 116810 Machine 20549 Machine 323711 Time12345 Machine 116897 Machine 225310-- Machine 304--11--

17
Results: LNS Both algorithms fail on this graph. Here are the LNS schedules: Time1234 Machine 123411 Machine 216810 Machine 30579 Time12345 Machine 1036811 Machine 214109-- Machine 3257--

18
Results: Planar Graphs Even if we restrict to planar 2-predecessor graphs, there are instances for which both CP and LNS have inconsistent C max Time12345 Machine 123867 Machine 20--5911 Machine 31--41012 Time123456 Machine 12354710 Machine 20--8911-- Machine 31--6 12-- Each schedule satisfies both the CP and LNS heuristics

19
Other Heuristics? P2 | prec, p j = 1 | C max has been solved efficiently All highest level first (HLF) schedules are optimal Proof, almost-linear algorithm given by [Gabow 1982] Level of a node: length of critical path starting at that node

20
HLF Heuristic A restriction of CP schedules 1.Process nodes from highest to lowest level 2.When finishing a level, if a machine remains available, “jump” a runnable job from the highest possible level 3.If there are multiple candidates, choose the one that allows future jumps to be to as high level as possible

21
Jumps With 2 machines, 16 is processed and a machine is free Node 15 or 10 can be “jumped” to run on the free machine Choose 15, since higher level Image: [Gabow 1982]

22
Generalizing to M >= 3 Not obvious how to generalize Gabow’s algorithm, since it assumes only one job is jumped each time For M = 3, can jump either 1 or 2 jobs each time Can still generate HLF schedules, though less efficiently, and observe performance Assumption: given a choice, we want to jump as many nodes as possible, minimizing idle time

23
HLF Self-Consistency Check if HLF schedules for the same instance agree on C max Generate 20,000,000 instances, each with 20 nodes, K = 3 Compare makespan of all HLF schedules

24
HLF Self-Consistency Result: no disagreements occurred Caveats: Does not mean no disagreement is possible Even if it is consistent, does not mean it is optimal

25
HLF Non-Optimal There are (very rare) instances where some CP schedules beat HLF

26
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

27
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

28
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

29
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

30
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

31
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: Highest level at the bottom. Level is in [brackets]. Green nodes are executed on their level; blue nodes are jumped. CP Schedule: Superior HLF Schedule: Inferior

32
HLF Non-Optimal Time1234567 M11348131419 M205710111617 M326--1291518 Time12345678 M1043710111715 M21589131418-- M32612-- 1619-- Note: It’s actually optimal to execute fewer nodes early on, so that the critical job #7 can finish earlier. CP Schedule: Superior HLF Schedule: Inferior

33
HLF Non-Optimal In the 2-processor case, you always jump 1 node With 3 processors, can choose between jumping 1 or 2 Sometimes, it’s better to jump 1 to allow a critical job to run earlier

34
Numerical Results Average makespan for each algorithm given M, N, K M: number of machines N: number of jobs K: branching factor MNKCPLNSHLFRANDOM 3203 3253 31003 6403 61003 6 4

35
Numerical Analysis HLF is better than CP and LNS (by a tiny fraction) HLF implementation too inefficient to run on large graphs CP and LNS near identical, some divergence when K changed MNKCPLNSHLFRANDOM 3203 7.8447.8467.8438.154 3253 9.3209.3219.3199.814 31003 33.968 N/A 34.544 6403 19.814 N/A 20.988 61003 21.309 N/A 22.585 61004 16.34416.354 N/A 17.068

36
Numerical Analysis Random performed admirably, but scaled less well as number of machines increased (though difference seemed to shrink with branching factor) MNKCPLNSHLFRANDOM 3203 7.8447.8467.8438.154 3253 9.3209.3219.3199.814 31003 33.968 N/A 34.544 6403 19.814 N/A 20.988 61003 21.309 N/A 22.585 61004 16.34416.354 N/A 17.068

37
End

Similar presentations

OK

Chapter 5 Section 1 – 3 1. Constraint Satisfaction Problems (CSP) Backtracking search for CSPs Local search for CSPs 2.

Chapter 5 Section 1 – 3 1. Constraint Satisfaction Problems (CSP) Backtracking search for CSPs Local search for CSPs 2.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google