A Study on project scheduling under multiple resource constraints

김 판 술

The PERT/CPM procedures are considered as the basis of the most successful program in project scheduling. Unfortunately, these procedures cannot be used in scheduling many real-life projects. This is due to the fact that in these procedures it is assumed that there is an infinite number of resources available for each activity in the project network. Obviously, the completion time under no constraints is less than when constraints are imposed. Optimal solutions to this problem are very difficult to obtain. One way of approaching this problem is to use heuristic solution techniques. A heuristic is a set of decision rules that might lead to an optimal solution. In this paper, we present three heuristics, maximum resource application rule, minimum time application rule, and maximum resources to activities of projects under multiple resource constraints. Comparisons of the project durations show that these heuristic rules are superior to AG3 rule(Elsayed et al.[1])