AbstractThis paper presents a resource allocation technique in the form of a branch and bound algorithm which optimizes the allocation at a specific point in time. The algorithm allows the user to attach individual performance ratings to each resource and weighting factors to each activity under consideration. A small sample problem is presented and solved to illustrate the use of the algorithm.