Sie sind auf Seite 1von 17

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

 Manager Project 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?

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.

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

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

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

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

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

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.

Machine

Trencher x

Trencher Y

Trencher Z

Cost of Operating (\$)

Project C

12,000

12,600

15,800

Project D

20,600

25,400

30,600

Project E

6,400

6,800

9,200

22

Example 2 II

Linear Programming Formulation for

Example 1: Equipment Assignment Example Minimize Z = 12000 X xc +20600X XD + 6400X XE +12,600X YC +25400X YD + 6800X YE +15800X ZC +30600X ZD +

9200X

ZE

23

Example 2 III

Subject to:

X xc + X XD + X XE =1

X YC +X YD + X YE =1

X ZC +X ZD +X ZE = 1

X xc + X YC + X ZC =1

X XD + X YD +X ZD =1

X XE + X YE + X ZE = 1

X xc , X XD , X XE , X YC , X YD , X YE , X ZC , X ZD ,

X ZE {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

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

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

26

Example 3 III

Minimize Z = 69X 1A +42X 1B +66X 1C + 63X 1D +60X 2A +54X 2B +36X 2C +48X 2D +75X 3A +48X 3B +42X 3C + 66X 3D

Subject to:

X 1A + X 1B + X 1C + X 1D ≤ 600 X 2A + X 2B + X 2C + X 2D ≤ 900 X 3A + X 3B + X 3C + X 3D ≤ 600 X 1A + X 2A + X 3A = 300 X 1B + X 2B + X 3B = 540 X 1C + X 2C + X 3C = 450 X 1D + X 2D + X 3D = 760

27

Example 3 IV

Nonnegative Constraint:

X 1A ≥ 0, X 1B ≥ 0, X 1C ≥ 0, X 1D ≥ 0, X 2A ≥ 0, X 2B ≥ 0, X 2C ≥ 0, X 2D ≥ 0, X 3A ≥ 0, X 3B ≥ 0, X 3C ≥ 0, X 3D ≥ 0

28