A resource allocation problem in a design organization and a numerical method for its solution

The operation of a design organization is mathematically described and the problem of resource allocation is formulated with the criterion (maximizing the number of activities completed within a planned horizon) given as a functional whose parameters are specific cost of the resources and the penalty function. A numerical solution method is proposed which makes use of the problem decomputed composition technique and whereby the times of activity starts are by a dynamic priority rule developed by using the branch-and-bound method.