Szögi E., Kis T.: Scheduling jobs to minimize a convex function of resource usage, Proceedings of the 18th Conference on Computer Science and Intelligence Systems pp. 791–799.
In this paper we describe polynomial time algorithms for minimizing a separable convex function of the resource usage over time of a set of jobs with individual release dates and deadlines, and admitting a common processing time.
