M. I. Rebezova

  • Citations Per Year
Learn More
A method for calculating the activity completion time distribution in network chart based on polynomial approximations is presented. The method allows us to describe the activity time distributions of both individual activities and their various combinations (such as sum, maximum, and minimum) in a uniform manner.
A generalization of the classical knapsack problem in which the effect of the selected items depends on the interactions between the items and may be arbitrary is considered. The mathematical model, the optimization algorithm, and the corresponding software are developed. The suggested approach is illustrated by a numerical example.
  • 1