Summary path in an interactive graphical interface
AssigneeSmartsheet Inc.
InventorPrasad Pramod Sangekar
Life of this patent
Estimating the term…
Abstract
Methods to identify summary paths within specific parent task domains within a project enable the efficient computation and display of summary paths in Gantt or other project management structured user interfaces. These methods are computationally more efficient than conventional critical path computations and enable a finer-grained identification of critical tasks or sub-paths. User's may generate summary paths in specific parent domains and identify critical tasks and sub-paths therein faster, with lower computational overhead, and with fewer physical actions.
Claims20
A scheduler for prioritizing a chain of tasks for performance by a system, the scheduler comprising:
- a processor;
- and
- a memory configured with instructions that when applied to the processor for execution, configure the processor to:
- form a set of last-finisher child tasks of a first parent task displayed in a structured project management user interface;
- determine a dependency graph for each child task in the set of last-finisher child tasks, wherein a task is added to the dependency graph on condition that it has a predecessor of zero slack;
- for each dependent task in each of the dependency graphs, determine whether the dependent task is outside a domain boundary of the first parent task;
- on condition that the dependent task is not outside the domain boundary, add the dependent task to a summary path for the first parent task;
- and
- identify the summary path on the structured project management user interface to indicate a higher-priority for tasks in the summary path than for tasks not in the summary path.
A scheduler for prioritizing a particular task for performance by a system, the scheduler comprising:
- a processor;
- and
- a memory configured with instructions that when applied to the processor for execution, configure the processor to:
- for each parent task from a set of multiple parent tasks selected using an input device from the structured project management user interface:
- form a set of last-finisher child tasks for the parent task, the set of last-finisher child tasks not constrainted by a domain boundary of the corresponding parent task;
- determine dependency graphs through zero slack paths leading from the parent task to each task in the set of last-finisher child tasks, the dependency graphs terminating at a domain boundary of any of the parent tasks;
- on the structured project management user interface, forming a contrasted summary path based on the dependency graphs;
- determining a critical task common to multiple summary paths thus formed;
- and
- escalating the critical task to a highest priority in the set of multiple parent tasks.
A method of generating a contrasted visualization on a structured project management user interface, the method comprising:
- forming a set of last-finisher child tasks of a first parent task displayed on the structured project management user interface;
- determining a dependency graph for each task in the set of last-finisher child tasks, wherein a task is added to the dependency graph on condition that it has a predecessor of zero slack;
- for each dependent task in each of the dependency graphs, determining whether the dependent task is outside a domain boundary of the first parent task;
- on condition that the dependent task is not outside the domain boundary, adding the dependent task to a summary path for the first parent task;
- and
- on condition that there are no more dependent tasks for any of the dependency graphs, contrasting a set of tasks forming the summary path on the structured project management user interface.
A method of generating a contrasted visualization on a structured project management user interface, the method comprising:
- for each parent task from a set of multiple parent tasks selected using an input device from the structured project management user interface:
- forming a set of last-finisher child tasks for the parent task;
- determining dependency graphs through zero slack paths leading from the parent task to each task in the set of last-finisher child tasks, the dependency graphs terminating at a domain boundary of any of the parent tasks;
- on the structured project management user interface, forming a contrasted summary path based on the dependency graphs;
- determining a critical task common to multiple summary paths thus formed;
- and
- distinguishing the critical task from other tasks in the multiple, contrasted summary paths.
A method for scheduling a set of tasks for performance by a system, the method comprising:
- forming a set of last-finisher child tasks of a parent task displayed in a structured project management user interface, wherein the set of last-finisher child tasks is not constrained within a domain boundary of the parent task;
- determining a dependency graph for each child task in the set of last-finisher child tasks, wherein a task is added to the dependency graph on condition that it has a predecessor of zero slack;
- for each dependent task in each of the dependency graphs, determining whether the dependent task is outside the domain boundary of the parent task;
- on condition that the dependent task is not outside the domain boundary, adding the dependent task to a summary path for the parent task;
- and
- on condition that there are no more dependent tasks for any of the dependency graphs, increasing a resource allocation of the system to the tasks in the summary path.
Dependencies are inferred from the claim text.