Resource Allocation – Weist’s Procedure

Suppose, however, that only 10 men are available for the project on any one day. To obtain a heuristic solution, the following heuristics can be applied.
1. Allocate resources serially in time. That is, start on the first day and schedule all jobs possible, then do the same on the second day, and so on.
2. When several jobs compete for the same resources, give preference to the jobs with the least slack.
3. Reschedule non-critical jobs, if possible, to free resources for scheduling critical or non-slack jobs.

Hence, the project duration has been extended to 14 days but it keeps the manpower requirement under the tab of 10. This obtained solution might not be the optimal solution to the problem, but is a decent approximation for practical use.