We consider the problem of finding an acceptable schedule of a set of preemptive jobs, for which there are two types of resources - renewable and non-renewable. At specified points in time, requests for additional jobs are received that do not allow interruptions and require only renewable resources. We characterized each job by a directive interval and volume. It is required to determine whether there is an acceptable schedule for the entire set of jobs and build it, if it exists. To solve this problem, we developed an algorithm based on reducing it to the problem of the minimum cost flow in a network of a special kind. Tasks of this kind arise in the development of real-time systems, in particular on-board systems, systems for processing large amounts of economic and environmental information in real time, transport and conveyor systems