Example: building a house A small sample: Let ti, to, tm, tn, tt, to be start times of the associated tasks. Now use the graph to write the dependency constraints: 0,3 FINISH $,2 CARPENTRY Source: HBR 1963 43 FINISH FLOORING m,1 VARNISH FLOORS KITCHEN FIXTURES n,2 13 PAINT FINISH PLUMBING • Tasks o, m, and n can't start until task / is finished, and task / takes 3 days to finish. So the constraints are: ti +3≤ to, t₁ + 3 ≤ tm, ti +3 ≤ tn . Task t can't start until tasks m and n are finished. Therefore: tm +1≤tt, tn + 2 ≤ tt, • Task s can't start until tasks o and t are finished. Therefore: to +3≤ts, tt + 3 ≤ ts 4-24
Example: building a house A small sample: Let ti, to, tm, tn, tt, to be start times of the associated tasks. Now use the graph to write the dependency constraints: 0,3 FINISH $,2 CARPENTRY Source: HBR 1963 43 FINISH FLOORING m,1 VARNISH FLOORS KITCHEN FIXTURES n,2 13 PAINT FINISH PLUMBING • Tasks o, m, and n can't start until task / is finished, and task / takes 3 days to finish. So the constraints are: ti +3≤ to, t₁ + 3 ≤ tm, ti +3 ≤ tn . Task t can't start until tasks m and n are finished. Therefore: tm +1≤tt, tn + 2 ≤ tt, • Task s can't start until tasks o and t are finished. Therefore: to +3≤ts, tt + 3 ≤ ts 4-24
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Buiding an optimization model for the building a house problem, and solve it using JuMP and Clp.Example: building a house
A small sample:
Let t1,t0,tm,tn,tt,ts be start
times of the associated tasks.
Now use the graph to write the
dependency constraints:
Tasks 0,m, and n can't start until task I is finished, and task I
takes 3 days to finish. So the constraints are:
t1+3≤3≤t0,t1+3≤tm,t1+3≤tn
Task t can't start until tasks m and n are finished. Therefore:
tm+1≤tt,tn+2≤tt,takes 3 days to finish. So the constraints are:
Task s can't start until tasks 0 and t are finished. Therefore:
t0+3≤ts,tt+3≤ts
Transcribed Image Text:Example: building a house
A small sample:
Let ti, to, tm, tn, tt, to be start
times of the associated tasks.
Now use the graph to write the
dependency constraints:
0,3 FINISH
$,2
CARPENTRY
Source: HBR 1963
43 FINISH FLOORING
m,1
VARNISH FLOORS
KITCHEN
FIXTURES
n,2
13 PAINT
FINISH
PLUMBING
• Tasks o, m, and n can't start until task / is finished, and task /
takes 3 days to finish. So the constraints are:
ti +3≤ to, t₁ + 3 ≤ tm, ti +3 ≤ tn
. Task t can't start until tasks m and n are finished. Therefore:
tm +1≤tt, tn + 2 ≤ tt,
• Task s can't start until tasks o and t are finished. Therefore:
to +3≤ts, tt + 3 ≤ ts
4-24
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY