Question

3- Tables below show activities of a small project, predecessors, duration time, and resources that are required (machines and workers). There are 3 machines and 4 workers available each day. Please use resource allocation algorithm to optimally allocate the recourses to the activities. Please specifies the project completion time.

Table 1: Activities, predecessors and duration time.

Activity	Predecessor	Duration
A	-	2
B	B	2
C	A,B	1
D	C,D	2
E	D	3

Table 2: Activities and their required number of workers and machines.  

	A	B	C	D	E
# required of workers	3	3	4	1	2
# of required machines	0	3	3	2	3

Answer 1

Ans. Given that From the given data is There are 3 machines and u workers availblo } each day. now o find the Earlier ces), ondfinin (EP) Start (1s) and LatestCLE) times slackl's) each activity Earliest start in collared by forward path method.. Where slack=Latest finish-Earlies finira 크 2 ६ Resources Required AIB Pred ع تر anco کرا E Ele Em 215 ces /resour م Goods ha 七七 Redoutes ۲ < sta h 45 el Duration for not 2- Lests Er if black tines 2 oz 4 -- ñ o o o 3 w uw13,3 7 8 to 2 3 o a u 15 w f {3 12 7/8/9/lo