Synthesis problems in allocating continuous, doubly constrained resources among dynamic activities

The paper considers problems of scheduling independent activities which are processed using continuously-divisible, doubly constrained resources and are described by continuous functions: processing speed vs. resource amounts. The problems are to find optimal, in a vector sense, resource levels and the schedule length or the maximum lateness. The paper presents a methodology for transforming optimally these problems to corresponding static vector-optimum problems.