# Proj2_G1 - 5 2 10 8 5 6 9 3 12 4 13 10 6 14 12 5 2 1 1 2 3...

This preview shows pages 1–2. Sign up to view the full content.

STQP 2043 OPERATIONS RESEARCH SEMESTER I SESSION 2009/2010 PROJECT 2 GROUP 1 1) Faidzyn and Asscociates, Inc., is an accounting firm that has three new clients. Project leaders will be assigned to the three clients. Based on the different background and experiences of the leaders, the various leader-client assignments differ in terms of projected completion times. The possible assignments and the estimated completion times in days are Client Project Leader 1 2 3 Jamilah 10 16 32 Emilia 14 22 40 Syawal 22 24 34 Borhan 14 18 36 a) Formulate an LP model for the problem. b) Use Hungarian method to solve the problem. c) Use LINDO or Excel Solver to support your optimal solution. 2) Use Djikstra’s algorithm to find the shortest path between nodes 1 and 10 in the following network.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5 2 10 8 5 6 9 3 12 4 13 10 6 14 12 5 2 1 1 2 3 4 5 6 7 8 9 10 11 3) Building a backyard swimming pool consists of nine major activities. The activities and their immediate predecessors and the activity time estimates (in days) for the swimming pool construction project are shown in the table below. Activity Immediate Predecessor Optimistic Time Most Likely Time Pessimistic Time A - 3 5 6 B - 2 4 6 C A,B 5 6 7 D A,B 7 9 10 E B 2 4 6 F C 1 2 3 G D 5 8 10 H D,F 6 8 10 I E,G,H 3 4 5 a) Draw the network representation of the project above. b) What are the critical activities and critical path of this project? c) What is the expected time to complete the project? d) What is the probability that the project can be completed in 25 or fewer days?...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

Proj2_G1 - 5 2 10 8 5 6 9 3 12 4 13 10 6 14 12 5 2 1 1 2 3...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online