US 8,893,140 B2Granted

System and method for dynamically coordinating tasks, schedule planning, and workload management

AssigneeLife Coded, LLC

InventorJohn J. Meyer

Life of this patent

Estimating the term…

Loading patent…

Abstract

Systems and methods for dynamically coordinating a plurality of tasks are provided. Such tasks include a priority rank and at least one of a target date, a classification, an associated application, an associated action, and an associated priority rank adjustment parameter. A particular task can be processed relative to other tasks to generate a first scheduling scheme that defines a prioritized arrangement of the tasks. Based on the priority rank adjustment parameter(s), further scheduling schemes can be generated in lieu of the first scheduling scheme, thereby accounting for the respective priority rank adjustment parameters by influencing the arrangement of the tasks relative to one another. Additionally, based on a status notification, the tasks can be processed to generate a scheduling scheme that accounts for the status notification by influencing the arrangement of the first task and the stored tasks relative to one another.

Claims28

Dependent claims

A method for dynamically coordinating a plurality of tasks stored in a database using a computing device, the computing device having a processor, a memory, and a coordination application stored in the memory and executable by the processor, each task having a priority rank and at least one of the stored tasks having a priority rank adjustment parameter associated therewith the method comprising:

receiving a first task at the computing device, the first task having an associated priority rank and priority rank adjustment parameter;
processing the first task relative to the plurality of stored tasks using the processor to generate a first scheduling scheme that defines a prioritized arrangement of the first task and the stored tasks;
receiving a status notification at the processor concerning at least one of the first task and the stored tasks;
based on the received status notification, further processing the first task and the stored tasks using the processor to dynamically generate a second scheduling scheme to replace any prior scheduling scheme, the second scheduling scheme comprising a prioritized arrangement of the first task and the stored tasks that accounts for the status notification by influencing the arrangement of the first task and the stored tasks relative to one another and to provide an optimized schedule that accounts for the various priorities and scheduling constraints that are associated with each individual task among the first task and each of the plurality of stored tasks;
based on the priority rank adjustment parameter, further processing the first task and the stored tasks to dynamically generate a third scheduling scheme in lieu of any prior scheduling scheme that defines a prioritized arrangement of the first task and the stored tasks that accounts for the respective priority rank adjustment parameters by influencing the arrangement of the first task and the stored tasks relative to one another;
and
rendering a visual depiction of the most recently defined scheduling scheme at the computing device.

4 more elements

A dynamic coordination system comprising:

a processor;
a control circuit operatively connected to the processor;
a memory operatively connected to the control circuit and accessible by the processor;
a coordination application stored in the memory and executable in the processor;
and;
the dynamic coordination system being in communication with a database having a plurality of tasks;
wherein the coordination application, when executed by the processor, configures the control circuit to:
receive a first task, the first task including a priority rank, the first task and and at least one of the stored tasks in the set of the stored tasks having a priority rank adjustment parameter associated therewith;
receive a status notification from a user concerning at least one of the first task and the stored tasks;
process the first task relative to the plurality of stored tasks to generate a first scheduling scheme the defines a prioritized arrangement of the first task and the stored tasks;
based on the priority rank adjustment parameter, further process the first task and the stored tasks to dynamically generate a second scheduling scheme in lieu of the first scheduling scheme that defines a prioritized arrangement of the first task and the stored tasks that accounts for the respective priority rank adjustment parameters by influencing the arrangement of the first task and the stored tasks relative to one another;
based on the received status notification, further process the first task and the stored tasks to dynamically generate a third scheduling scheme to replace any prior scheduling scheme, the third scheduling scheme comprising a prioritized arrangement of the first task and the stored tasks that further accounts for the status notification by influencing the arrangement of the first task and the stored tasks relative to one another;
and
render a visual depiction of the most recently defined scheduling scheme.

11 more elements

Dependencies are inferred from the claim text.

Facts

Application: 13/357,453Filed 24 Jan 2012
Published: US 2013/0191836 A125 Jul 2013
Granted: 18 Nov 2014
Term ends: Not estimatedThe source records don’t support an estimate.

Classification4 codes

G06Q 10/063114
Scheduling, planning or task assignment for a person or group: status monitoring or status determination for a person or group
G06F 9/4881
By program, e.g. task dispatcher, supervisor, operating system: scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
G06Q
Information and communication technology [ict] specially adapted for administrative, commercial, financial, managerial
G06F
Computing and data processing