1. Given the following project:

1. Develop a resource-constrained schedule using the sequential heuristic.

Activity	Predecessor	Duration (week)	Required No. of Workers
A	-	1	1
B	-	3	2
C	A	4	2
D	A,B	5	1
E	B	3	2
F	C,D,E	2	2

Assume the followings:

• The original sequential relationships of the network cannot be violated.
• An activity can be scheduled at any time between the ES and LS times
• Scheduling priority for each activity is determined via the following rules

• early start time
• least total slack
• smallest duration
• maximum resource level

• once an activity is scheduled it continues without interruption

The available resource is three workers.