Question

The duration and resource usage for each activity are showed in the table below.

Activity	Predecessor	Total Processing Time (days)	# of painters required/day
A	---	0.5	1
B	---	1	1
C	A,B	1	1
D	C	1	1

Assume the maximum number of painters is 1. Level the resources by following the rule "Delay the activity with the most positive slack first". Please indicate the schedule of acitivity B after leveling recources (Suppose the project begins on day 1).

Answer Options:

In the morning of Day 2

The whole day of Day 1

In the morning of Day 1

The whole day of Day 2

Answer 1

The Activity diagram will be:

Computation of earliest starting and finishing times is aided by two simple rules:
1. The earliest finish time for any activity is equal to its earliest start time plus its expected
duration, t:
EF = ES + t
2. ES for activities at nodes with one entering arrow is equal to EF of the entering arrow. ES
for activities leaving nodes with multiple entering arrows is equal to the largest EF of the
entering arrow.
Computation of the latest starting and finishing times is aided by the use of two rules:
1. The latest starting time for each activity is equal to its latest finishing time minus its
expected duration:
LS = LF - t
2. For nodes with one leaving arrow, LF for arrows entering that node equals the LS of the
leaving arrow. For nodes with multiple leaving arrows, LF for arrows entering that node
equals the smallest LS of leaving arrows.
Finding ES and EF times involves a forward pass through the network; finding LS and LF
times involves a backward pass through the network. Hence, we must begin with the EF of the
last activity and use that time as the LF for the last activity. Then we obtain the LS for the last
activity by subtracting its expected duration from its LF
Slack = LS-ES = LF-EF
Activities for which Slack = 0 are in critical path

	Expected time	ES	EF	LS	LF	Slack	On Critical Path
A	1	0	0.50	0.50	1.00	0.50	No
B	1	0	1.00	-	1.00	-	Yes
C	1	1	2.00	1.00	2.00	-	Yes
D	1	2	3.00	2.00	3.00	-	Yes

The printer allocation will begin with either A or B. However, A has Slack of 0.5 and B has Slack of 0. So, first, the allocation will be to B. Also, the processing time is 1 day. So, B will begin on Day 1 and continue for whole day

Ans - The whole day of Day 1

If you liked my answer, please give an Up-vote. This will be quite encouraging for me. Thank you!