Planning of tasks with аsynchronous start

Real-time systems with a finite quantity of tasks with arbitrary moments of start are under consideration. A system is called resolvable if there exists a planning providing in time completion of each task. Planning is monotonous if at any moment a performing task is a task with minimum time resource. The main result states that for each resolvable system there exists a resolving monotonous planning.