Allocation of non-uniform complex of resources in production systems. Scheduling and correction of deadlines

Abstract

The problem of planning a job complex with the use of resources of various types − renewable (performers who can differ with the productivity) and several types of non-renewable is considered. We allow interruptions, and switching from one performer to another and performing one work simultaneously by several performers. The available number of performers at different times is not constant, and their productivity may vary. A developed polynomial algorithm finds the optimal allocation of resources and builds the optimal schedule of jobs. A pseudopolynomial algorithm for finding the optimal allocation of resources of minimal cost has been developed. These algorithms based on building a flow network model and modifying the packing procedure. An algorithm for the optimal allocation of resources and the construction of an optimal schedule for the case of a heterogeneous set of works is proposed.