Within the framework of the multilevel management system for complex systems, the task of the tactical level of determining an acceptable schedule for a complex set of works is considered. The jobs are divided into two types. Job of the first type allows interruptions during execution. The second type of jobs is uninterrupted. To perform jobs, a heterogeneous set of resources is used - renewable and non-renewable. Renewable resources are represented by several processors, the performance of which may differ from each other. Non-renewable resources are divided into several types. The scope of jobs is not known in advance and depends on the amounts of non-renewable resources allocated to it. A deadline has been set, no later than which all jobs must be completed. An approximate polynomial algorithm for creating an admissible schedule for completing a set of jobs has been developed