US 10,853,746 B2Granted

Systems and methods for scheduling work items

AssigneeAtlassian Pty Ltd.

InventorsMartin Suntinger, Martin Sturm, Hannes Obweger

Life of this patent

Estimating the term…

Loading patent…

Abstract

Disclosed herein is a computer implemented scheduling method. The method comprises processing project data to determine one or more team-specific scheduling solutions for work items, each team specific scheduling solution for the work item defining a particular team and one or more iterations of that particular team in which the work item can be completed; identifying from the one or more team-specific scheduling solutions an optimal scheduling solution for the work item, the optimal scheduling solution being selected based at least in part on the number of iterations defined by each of the one or more team-specific scheduling solutions; and scheduling the work item according to the optimal scheduling solution identified for the work item.

Claims26

Dependent claims

A computer implemented scheduling method comprising:

accessing project data from computer readable storage media using a computer processor, the project data comprising:
work item data defining a plurality of work items to be scheduled;
resource data defining a plurality of resources;
team data defining a plurality of teams, each team being associated with one or more resources and having a schedule of iterations;
performing, by the computer processor, preprocessing to reduce processing time and memory usage of the computer implemented method;
for each work item:
processing, using the computer processor, the project data to determine one or more team-specific scheduling solutions for the work item, each team specific scheduling solution for the work item defining a particular team, one or more iterations of that particular team in which the work item can be completed, and a number of iteration violations, wherein an iteration violation occurs when an additional iteration needs to be used to complete the work item;
wherein the processing takes into account a constraint that limits each team of the plurality of teams to utilizing the one or more resources associated with the team as defined by the project data;
identifying from the one or more team-specific scheduling solutions, using the computer processor, an optimal scheduling solution for the work item, the optimal scheduling solution being selected based at least in part on a least number of iteration violations defined by each of the one or more team-specific scheduling solutions;
and
scheduling the work item using the computer processor according to the optimal scheduling solution identified for the work item.

8 more elements

A system comprising:

one or more processors;
one or more non-transitory computer-readable storage media storing sequences of instructions which, when executed by the one or more processors, cause the one or more processors to:
access project data from the one or more non-transitory computer-readable storage media using the one or more processors, the project data comprising:
work item data defining a plurality of work items to be scheduled;
resource data defining a plurality of resources;
team data defining a plurality of teams, each team being associated with one or more resources and having a schedule of iterations;
performing preprocessing to reduce processing time and memory usage of the computer implemented method;
for each work item:
process the project data using the one or more processors to determine one or more team-specific scheduling solutions for the work item, each team specific scheduling solution for the work item defining a particular team, one or more iterations of that particular team in which the work item can be completed, and a number of iteration violations, wherein an iteration violation occurs when an additional iteration needs to be used to complete the work item;
wherein the processing takes into account a constraint that limits each team of the plurality of teams to utilizing the one or more resources associated with the team as defined by the project data;
identify from the one or more team-specific scheduling solutions using the one or more processors an optimal scheduling solution for the work item, the optimal scheduling solution being selected based at least in part on a least number of iteration violations defined by each of the one or more team-specific scheduling solutions;
and
scheduling the work item using the one or more processors according to the optimal scheduling solution identified for the work item.

10 more elements

Dependencies are inferred from the claim text.