Construction Project Management

(CE 110401346)

6c. Practice Examples

Construction Process Optimization

Dr. Khaled Hyari

Department of Civil Engineering
Hashemite University
 Example 1 I

Five construction managers who differ in ability and

experience are to be placed in charge of five projects
which are different in type and value. The suitability
of each manager for each project is assessed on a
numerical scale with a maximum of twenty points.
The results are shown below
Project
Manager
1 2 3 4 5
A 18 16 11 19 5
B 14 10 15 8 6
C 9 13 8 8 6
D 15 14 10 12 10
E 11 11 14 10 8 10
 Example 1 II

To which project should each

manager be assigned in order to
obtain the highest total points score
for the firm?

11
 Example 1 III

The problem here is to maximize output that is to

allocate construction managers such that the overall
output for all the construction projects is the best
possible.
This can be converted to a minimization problem by
considering the points below the maximum that each
construction manager's suitability was assessed for
each construction project.
If the construction manager A was assessed at 18 points
out of twenty for project1, the new scale to be used for the
minimization problem is (20-18) that is 2.
The table below represents the mark down figures for
each construction manager in each project.
12
 Example 1 IV

Project
Manager
1 2 3 4 5
A 2 4 9 1 15
B 6 10 5 12 14
C 11 7 12 12 14
D 5 6 10 8 10
E 9 9 6 10 12

13
 Example 1 V

Manager Project Difference

1 2 3 4 5
A 2 4 9 1 15 1
B 6 10 5 12 14 1
C 11 7 12 12 14 4
D 5 6 10 8 10 1
E 9 9 6 10 12 3
Difference 3 2 1 7 2

Assign Project Manager A to Project 4

14
 Example 1 VI

Manager Project Difference

1 2 3 4 5

B 6 10 5 14 1
C 11 7 12 14 4
D 5 6 10 10 1
E 9 9 6 12 3
Difference 1 1 1 2

Assign Project Manager C to Project 2

15
 Example 1 VII

Manager Project Difference

1 2 3 4 5

B 6 5 14 1

D 5 10 10 5
E 9 6 12 3
Difference 1 1 2

Assign Project Manager D to Project 1

16
 Example 1 VIII

Manager Project Difference

1 2 3 4 5

B 5 14 9

E 6 12 6
Difference 1 2

Assign Project Manager B to Project 3

17
 Example 1 IX
Manager Project Difference
1 2 3 4 5

E 12
Difference

Assign Project Manager E to Project 5

Total Scores: 1+7+5+5+12=30
18
 Example 2 I

Assignment of 3 available trenching machines of

different capabilities to three projects which must
be done concurrently.
Assignment to be made on the basis of minimum
cost to the company.
Cost of Operating ($)
Machine
Project C Project D Project E
Trencher x 12,000 20,600 6,400
Trencher Y 12,600 25,400 6,800
Trencher Z 15,800 30,600 9,200 22
 Example 2 II

Linear Programming Formulation for

Example 1: Equipment Assignment
Example
Minimize Z = 12000 Xxc +20600XXD+
6400XXE +12,600XYC+25400XYD +
6800XYE +15800XZC+30600XZD +
9200XZE

23
 Example 2 III

Subject to:
Xxc + XXD + XXE =1
XYC+XYD + XYE =1
XZC+XZD +XZE = 1
Xxc + XYC+ XZC=1
XXD + XYD +XZD =1
XXE + XYE + XZE = 1
Xxc , XXD , XXE , XYC , XYD , XYE , XZC , XZD ,
XZE {0,1} (integers) 24
 Example 3 I

Sources of Material Example

Four Concrete placements must be scheduled in a

single day, with concrete available from three
ready-mix suppliers

Concrete prices, delivered vary depending on

factors such as the distances from plants to
projects, project requirements, and data on
suppliers capacities
25
 Example 3 II

Requirements and Unit Prices

Available Project Project Project Project
Capacity, A B C D
Cubic
Yards Requirements, Cubic Yards
300 540 450 760
Plant 1 600 $69 $42 $66 $63
Plant 2 900 $60 $54 $36 $48
Plant 3 600 $75 $48 $42 $66

26
 Example 3 III

Minimize Z = 69X1A +42X1B+66X1C +

63X1D +60X2A +54X2B+36X2C +48X2D
+75X3A +48X3B+42X3C + 66X3D
Subject to:

X1A + X1B + X1C + X1D 600

X2A + X2B + X2C + X2D 900
X3A + X3B + X3C + X3D 600
X1A + X2A + X3A = 300
X1B + X2B + X3B = 540
X1C + X2C + X3C = 450
X1D + X2D + X3D = 760 27
 Example 3 IV

Nonnegative Constraint:
X1A 0, X1B 0, X1C 0, X1D 0, X2A 0, X2B 0, X2C
0, X2D 0, X3A 0, X3B 0, X3C 0, X3D 0

28