Patent ID: 9250960
Filing Date: 2016-02-02
CPC Classification: G06F

Claim Text:
1. A computer-implemented method for planning execution of a plurality of tasks according to a plurality of dependencies, the method comprising: receiving an indication of the tasks comprising, for each one of the tasks, an indication of a task type and an indication of an execution time; ordering the tasks into a task list according to a primary ordering criterion based on the task type and to a secondary ordering criterion based on the execution time; receiving an indication of the dependencies comprising, for each one of the dependencies, an indication of a dependency type for the task type and an indication of a dependency time for the execution time of a predecessor one of the tasks enabling the execution of a successor one of the tasks; ordering the dependencies into a dependency list according to the primary ordering criterion based on the dependency type and to the secondary ordering criterion based on the dependency time; scanning the dependency list starting from a beginning thereof for resolving each current one of the dependencies by scanning the task list, starting from a beginning thereof for a first one of the dependencies and from a point being reached for a previous one of the dependencies otherwise, for identifying the predecessor task as a current one of the tasks having the task type meeting the dependency type and the execution time meeting the dependency time; and planning the execution of the tasks according to the resolved dependencies.