Algorithms of optimal supply of resources to a group of projects (stochastic networks)

Several concurrently realized PERT-like network projects with random lengths of the their activities were considered. Each activity consumes several kinds of resources of fixed powers, all resources being reproducible in the course of their service. For each project, the schedule date and the admissible confidence probability of timely completion of the project were defined. The initial instants of realization of all projects, the required total power of each of the reproducible resources (for each project), the delivery schedule of rare reproducible resources that are not at the disposal of the project management system, and the schedule of beginning all activities (for each project) were determined. The minimal nonoperational costs (penalty provisions for failure to execute the project in time, fines for idling of the rare external resources, costs of resource lease, et al.,) were used as the target function.