Systems and methods for scheduling work items

Patent metadata

Field	Value
Publication number	US-10083412-B2
Application number	US-201514712309-A
Country	US
Kind code	B2
Filing date	May 14, 2015
Priority date	May 14, 2015
Publication date	Sep 25, 2018
Grant date	Sep 25, 2018

Abstract

Disclosed herein is a computer implemented scheduling method comprising: accessing project data from computer readable storage media. The project data comprises work item data defining a plurality of work items to be scheduled, and release data defining one or more releases into which one or more of the plurality of work items are to be scheduled. The method comprises processing, using a computer processor, the project data to schedule strictly assigned work items by identifying strictly assigned work items, a strictly assigned work item having a particular release into which the strictly assigned work item needs to be scheduled; and for each strictly assigned work item identified, scheduling the strictly assigned work item into the release specified for that strictly assigned work item.

First claim

What is claimed is:

1. A computer implemented scheduling method comprising:
a computing device accessing project data from a non-transitory computer readable storage media, the project data comprising:
work item data defining a plurality of work items to be scheduled,
release data defining one or more releases into which one or more work items of the plurality of work items are to be scheduled,
the computing device processing the project data to schedule strictly assigned work items by: identifying strictly assigned work items, a strictly assigned work item having a particular release into which the strictly assigned work item needs to be scheduled; and for each strictly assigned work item identified: scheduling the strictly assigned work item into the release specified for that strictly assigned work item, by:
wherein the work item data defines one or more strictly assigned work items, each strictly assigned work item of the one or more strictly assigned work items being associated with a release of the one or more releases into which the strictly assigned work item must be scheduled,
wherein the work item data defines at least one strictly assigned work item of the one or more strictly assigned work items as having one or more predecessor work items that must be completed before work can begin on the strictly assigned work item,
wherein the work item data defines one or more unconstrained work items, each unconstrained work item of the one or more unconstrained work items being associated with no particular release into which the unconstrained work item must be assigned and is not in the one or more predecessor work items of any of the one or more strictly assigned work items;
the computing device removing one or more of the plurality of work items that cannot be scheduled to reduce a processing time, a computing power, and a memory usage of the scheduling method;
the computing device, after removing, identifying a first set of work items, wherein the first set of work items includes the one or more strictly assigned work items and, for each strictly assigned work item of the one or more strictly assigned work items, any predecessor work items of the strictly assigned work item;
the computing device scheduling the first set of work items into the one or more releases, wherein each strictly assigned work item of the one or more strictly assigned work items is assigned to the particular release associated with the strictly assigned work item and any predecessor work items of the strictly assigned work item are assigned to be completed prior to beginning work on the strictly assigned work item;
the computing device identifying a second set of work items, wherein the second set of work items includes the one or more unconstrained work items;
the computing device, after scheduling the first set of work items, attempting to schedule the second set of work items into the one or more releases.

2. The computer implemented scheduling method according to claim 1 , wherein scheduling the first set of work items comprises:
in response to scheduling a strictly assigned work item into a particular release associated with the strictly assigned work item, determining whether there are any strictly assigned work items of the one or more strictly assigned work items that are also associated the particular release, but have yet to be assigned to the particular release;
responsive to determining that there are no remaining strictly assigned work items of the one or more strictly assigned work items that are associated with the particular release, but have yet to be assigned to the particular release, calculating an end date for the particular release.

3. The computer implemented scheduling method according to claim 1 , wherein scheduling the first set of work items comprises:
responsive to determining that all strictly assigned work items of the one or more strictly assigned work items associated with a particular release have been assigned to the particular release:
calculating an end date for the particular release,
identifying a dependent release that is dependent on the particular release, and
calculating a start time for the dependent release based on the end date calculated for the particular release.

4. The computer implemented scheduling method according to claim 1 , wherein scheduling the first set of work items:
identifying a first release of the one or more releases into which a predecessor work item of a particular strictly assigned work item could potentially be scheduled;
attempting to schedule the predecessor work item into the first release;
responsive to being able to schedule the predecessor work item into the first release, scheduling the causal predecessor work item into the first release; and
responsive to being unable to schedule the predecessor work item into the first release:
identifying a second release of the one or more releases into which the predecessor work item could potentially be scheduled; and
attempting to schedule the predecessor work item into the second release.

5. The computer implemented scheduling method according to claim 1 , wherein scheduling an unconstrained release work item of the second set of work items comprises:
identifying a first release of the one or more releases into which the unconstrained release work item could potentially be scheduled;
attempting to schedule the unconstrained release work item into the first release;
responsive to being able to schedule the unconstrained release work item into the first release, scheduling the unconstrained release work item into the first release; and
responsive to being unable to schedule the unconstrained release work item into the first release:
identifying a second release of the one or more releases into which the unconstrained release work item could potentially be scheduled; and
attempting to schedule the unconstrained release work item into the second release.

6. The computer implemented scheduling method according to claim 5 , wherein a release into which an unconstrained release work item could potentially be scheduled is a release which has an end time which is:
after an earliest start date of the unconstrained release work item; and
after any end dates of work items on which the unconstrained release work item is dependent.

7. A system comprising:
one or more processors;
one or more non-transitory computer-readable storage media storing one or more sequences of instructions which, when executed by the one or more processors, cause the one or more processors to perform:
accessing project data from computer readable storage media, the project data comprising:
work item data defining a plurality of work items to be scheduled,
release data defining one or more releases into which one or more work items of the plurality of work items are to be scheduled,
processing the project data to schedule strictly assigned work items by: identifying strictly assigned work items, a strictly assigned work item having a particular release into which the strictly assigned work item needs to be scheduled; and for each strictly assigned work item identified: scheduling the strictly assigned work item into the release specified for that strictly assigned work item, by:
wherein the work item data defines one or more strictly assigned work items, each strictly assigned work item of the one or more strictly assigned work items being associated with a release of the one or more releases into which the strictly assigned work item must be scheduled,
wherein the work item data defines at least one strictly assigned work item of the one or more strictly assigned work items as having one or more predecessor work items that must be completed before work can begin on the stri

Assignees

• Atlassian Pty Ltd

Inventors

• Suntinger Martin
• Sturm Martin
• Obweger Hannes

Classifications

• G06Q10/06314 Primary

  Calendaring for a resource · CPC title

• G06Q10/04

  Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) · CPC title