The information in the table below is available for a large fund-raising project.
a. Determine the critical path and the expected completion time of the project.
b. Plot the total project cost, starting from day 1 to the expected completion date of the project, assuming the earliest start times for each activity. Compare that result to a similar plot for the latest start times. What implication does the time differential have for cash flows and project scheduling?

Activity             Activity Time (days)           Activity Costs ($)               Immediate Predecessor(s)
A                                3                                      100                                  -
B                                4                                      150                                  -
C                                2                                      125                                 A
D                                5                                      175                                 B
E                                 3                                     150                                  B
F                                 4                                      200                                  C,D

Posted Date: 3/30/2013 7:06:42 AM | Location : United States

Ask an Expert

Related Discussions:- Determine the critical path and the expected completion, Assignment Help, Ask Question on Determine the critical path and the expected completion, Get Answer, Expert's Help, Determine the critical path and the expected completion Discussions

Write discussion on Determine the critical path and the expected completion
Your posts are moderated

Write your message here..

Related Questions

Abstract data type-stack, Conceptually, the stack abstract data type mimics... Conceptually, the stack abstract data type mimics the information kept into a pile on a desk. Informally, first we consider a material on a desk, where we might keep separate stack

Program insertion of a node into any circular linked list, Program Insertio... Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a

Types of triangular matrices, Triangular Matrices Tiangular Matrices is... Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

Process of analysis, The objective analysis of an algorithm is to determine... The objective analysis of an algorithm is to determine its efficiency. Efficiency is based on the resources which are used by the algorithm. For instance, CPU utilization (Ti

An algorithm to insert a node in beginning of linked list, Q. Write down an... Q. Write down an algorithm to insert a node in the beginning of the linked list.                         Ans: /* structure containing a link part and link part

Explain the stack, QUESTION Explain the following data structures: ... QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.

Usage of linked lists for polynomial manipulation, Q. Establish the usage o... Q. Establish the usage of linked lists for polynomial manipulation.                                       Ans. Usag e of Linked List for Polynomial Manipulation. Link

Shortest path dijkstras algorithm, * Initialise d & pi* for each vertex ... * Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)

Quick sort, This is the most extensively used internal sorting algorithm. I... This is the most extensively used internal sorting algorithm. In its fundamental form, it was invented by C.A.R. Hoare in the year of 1960. Its popularity lies in the easiness of i

Hashing and hash functions, Q. Describe the term hashing. Explain any two u... Q. Describe the term hashing. Explain any two usually used hash functions. Explain one method of collision resolution.