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