A real-time multiprocessor computing system is considered. Processors can have arbitrary performance levels. Using this system, a set of jobs (tasks) is performed. Jobs allow interruptions and switches from one processor to another and are characterized by directive intervals and volumes. An algorithm for constructing an admissible schedule has been developed. In the case where an admissible schedule does not exist, a technique for optimal correction of jobs has been developed. The algorithms are based on the use of flow networks with winnings