OPIM101 Management Science

Semester 3A, 2013/2014

Assignment 4
Due on Tuesday, 27th May 2014

All questions given are based on Introduction to Management Science (11 edition) by Taylor. Present the working
clearly and state the reason behind each constraint.

Each group will submit one copy of the solutions. Write the names of all your group members on the front of the
submitted copy.

1) Chapter 8, Question 6 (Indicate critical path and duration).

Critical path = 2 − 6 − 9 − 11 − 12 = 38 months

 2) *Chapter 8, Question 7 (Indicate critical path and duration). In addition, formulate the model to find the ES
of the network.

Critical path = 1 − 3 − 8 = 34 weeks 1 mark: 34 weeks

0.5 mark: AOA diagram

3,15 0.5 mark: Objective function
7
1 mark: Activity Arrow constraints

2 1 mark: Dummy constraints

4,4
1,10

5
7,7

8 9 10
1
5,6

6
8,9

2,7
3
6,12
11

4
 Let Xi be the start time for node i=1,…,11
Note: I did not simplify the network (with
Max X11 or Max X1+X2 + …+ X11
fewer dummy arrows). This representation
s.t.
is sufficient.

(Activity Arrows)
X2  X1+10
X3  X1 + 7 The model for project management is
X7  X2 + 15 dependent on the AOA diagram. You should
X5  X2 + 4 write out all the constraints and not use “…”
X6  X3 + 6 in your model.
X4  X3 + 12
X9  X8 +7
X11  X10 + 9 “…” should only be used in problems where
the modeling is straightforward.
(Dummy Arrows)

X8  X5
X8  X6
X10  X4
X10  X9
X10  X7

(Non-negativity)
Xi  0, i=1,…,11

3) Chapter 8, Question 12 (Farmer’s American Bank).

Critical path = a − d − g − k = 33 weeks

σ = 3.87
 4) Chapter 8, Question 35 (Cont’d from Farmer’s American Bank). Formulate the model. You do not need to
solve the model.

d,10
a,9
c,7

g,6

8 9 10
1

e,1 j,2

b,11
3
f,5 h,3
11

4
7

k,8

i,1

5
 Normal Crash Normal Crash Crash Allowable
Activity time time cost cost cost/day crash time
a 9 7 4,800 6,300 750 2
b 11 9 9,100 15,500 3,200 2
c 7 5 3,000 4,000 500 2
d 10 8 3,600 5,000 700 2
e 1 1 0 0 0 0
f 5 3 1,500 2,000 250 2
g 6 5 1,800 2,000 200 1
h 3 3 0 0 0 0
i 1 1 0 0 0 0
j 2 2 0 0 0 0
k 8 6 5,000 7,000 1,000 2

1) Compute allowable crash time and crash cost per day.

2) “Sketch” of the Model formulation:

Let Xi be the start time of each node, i=1,…,11

Let Yij be the amount of time to shorten in activity i-j.

Min 750 Y12 + 3200 Y13 + 500 Y23 + 700 Y28 + 250 Y34 + 200 Y89 + 1000 Y5,11

s.t.

(Target)
X11  26

(Activity)

X1  X2 + 9 – Y12
X3  X1 + 11 – Y13
X3  X2 + 7 – Y23
X8  X2 + 10 – Y28
X8  X3 + 1
X4  X3 + 5 – Y34
X9  X8 + 6 – Y89
X7  X8 + 3
X5  X7 + 1
X11  X10 + 2
X11  X5 + 8 – Y5,11

(Dummy Activity)
X10  X9
X10  X4
X5  X9
(Allowable crash)

Y11  2
Y13  2
Y23  2
Y28  2
Y34  2
Y89  1
Y5,11  2

(Non negativity)

Xi,Yij  0.

--END--