1.  Using the traditional method of CPM:

a.  What activities are on the critical path?

b.  What is the expected total lead time of the project?

2.  Using CCPM:

a.  What is the duration time for activities B, D and G?

b.  What activities are on the critical chain?

c.   Where should the Feeding Buffer(s) be positioned?

d.  How large is the Project Buffer?

e.  What is the expected total lead time for the project?

 

Posted Date: 3/12/2013 7:25:48 AM | Location : United States

Ask an Expert

Related Discussions:- Explain critical path and chain, Assignment Help, Ask Question on Explain critical path and chain, Get Answer, Expert's Help, Explain critical path and chain Discussions

Write discussion on Explain critical path and chain
Your posts are moderated

Write your message here..

Related Questions

[plkm, ` `

Question, A binary search tree is used to locate the number 43. Which of th... A binary search tree is used to locate the number 43. Which of the following probe sequences are possible and which are not? Explain. (a) 61 52 14 17 40 43 (b) 2 3 50 40 60 43 (c)

Single pointer pointing to the tail of the queue, Can a Queue be shown by c... Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Exact analysis of insertion sort, Exact analysis of insertion sort: Let... Exact analysis of insertion sort: Let us assume the following pseudocode to analyse the exact runtime complexity of insertion sort. T j   is the time taken to execute the s

First class Abstract data type , 3. A function to convert a complex number ... 3. A function to convert a complex number in algebraic form to a complex number in phasor form

Program, circular queue using c circular queue using c

Explain linked list and its types, Data Structure and Algorithm 1. Exp... Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Algorithm, implement multiple stack in one dimensional array implement multiple stack in one dimensional array

Graph traversal, 1) Which graph traversal uses a queue to hold vertices whi... 1) Which graph traversal uses a queue to hold vertices which are to be processed next ? 2) Which of the graph traversal is recursive by nature? 3) For a dense graph, Prim's a

Operation of algorithm, Operation of Algorithm The following sequence o... Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou