An Algorithm for Constructing Single Processor Static–Dynamic Schedules

An extended approach is proposed for using algorithms to find the maximum flow in a transport network when constructing schedules for performing work with interruptions in a new class of problems of creating static–dynamic schedules. This is accomplished by projecting realtime systems with the archi... View More