The paper deals with a resource-optimal scheduling problem. More precisely, the problem is to schedule a set of jobs on a single machine. The first case is when constraints on maximum job completion time are given and the objective is to minimize the total resource consumption. In the second case, the maximum job completion time and the total resource consumption are simultaneously minimized. Finally, some generalizations are discussed.