PLEASE PROCIVE THE TABLE!!!

A software company is moving its helpdesk operations center from Newark, New Jersey to Plano, Texas. Some of its employees will be moved to Plano and others will be terminated and replaced by new workers in Texas. The activities that must be carried out to implement the move are summarized in the following table.

Activity	Description	Predecessors	Weeks
A	Revise organizational structure		4
B	Select new office location		3
C	Determine personnel requirements	A	3
D	Design new call center	B, C	3
E	Renovate office space	D	9
F	Select employees to move	C	2
G	Hire new employees	F	3
H	Set up new administrative systems	A	4
I	Move office equipment and records	F	2
J	Train new employees	E, G, H, I	3

(a)

Draw the CPM network for this problem.

A graph with 11 nodes and 14 directed arcs is shown.

• Node Start is connected by directed arcs to nodes A and B.
• Node A is connected by a directed arc to node C.
• Node B is connected by a directed arc to node D.
• Node C is connected by directed arcs to nodes D, F and H.
• Node D is connected by a directed arc to node E.
• Node E is connected by a directed arc to node J.
• Node F is connected by directed arcs to nodes G and I.
• Node G is connected by a directed arc to node J.
• Node H is connected by a directed arc to node E.
• Node I is connected by a directed arc to node J.
• No directed arcs come from node J.

A graph with 11 nodes and 14 directed arcs is shown.

• Node Start is connected by directed arcs to nodes A and B.
• Node A is connected by directed arcs to nodes C and H.
• Node B is connected by a directed arc to node D.
• Node C is connected by directed arcs to nodes D and F.
• Node D is connected by a directed arc to node E.
• Node E is connected by a directed arc to node J.
• Node F is connected by directed arcs to nodes G and I.
• Node G is connected by a directed arc to node J.
• Node H is connected by a directed arc to node J.
• Node I is connected by a directed arc to node J.
• No directed arcs come from node J.

A graph with 11 nodes and 14 directed arcs is shown.

• Node Start is connected by directed arcs to nodes A and B.
• Node A is connected by a directed arc to node C.
• Node B is connected by directed arcs to nodes D and H.
• Node C is connected by a directed arc to node F.
• Node D is connected by directed arcs to nodes C and E.
• Node E is connected by directed arcs to nodes I and J.
• Node F is connected by a directed arc to node G.
• Node G is connected by a directed arc to node J.
• Node H is connected by a directed arc to node G.
• Node I is connected by a directed arc to node G.
• No directed arcs come from node J.

A graph with 11 nodes and 14 directed arcs is shown.

• Node Start is connected by directed arcs to nodes A and B.
• Node A is connected by a directed arc to node C.
• Node B is connected by a directed arc to node D.
• Node C is connected by a directed arc to node F.
• Node D is connected by directed arcs to nodes C, E, and H.
• Node E is connected by directed arcs to nodes I and J.
• Node F is connected by a directed arc to node G.
• Node G is connected by a directed arc to node J.
• Node H is connected by a directed arc to node F.
• Node I is connected by a directed arc to node G.
• No directed arcs come from node J.

(b)

Create a spreadsheet to calculate and summarize the earliest and latest start and finish times (in weeks), the slack for each activity, and the critical activities.

Activity	EST	EFT	LST	LFT	Slack	Critical?
A						---Select--- Yes No
B						---Select--- Yes No
C						---Select--- Yes No
D						---Select--- Yes No
E						---Select--- Yes No
F						---Select--- Yes No
G						---Select--- Yes No
H						---Select--- Yes No
I						---Select--- Yes No
J						---Select--- Yes No

(c)

What is the least amount of time (in weeks) required to complete the project?

weeks

artict. areat the citere actieks