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

A method for dynamically coordinating one or more scheduling schemes 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, the method comprising:

• exposing a scheduling scheme of a first user to a second user;
• receiving a task assignment from the second user, the task assignment reflecting an adjustment to the scheduling scheme of the first user;
• and
• processing the scheduling scheme of the first user and the task assignment to generate a further scheduling scheme for a first user.

A method for dynamically managing workload across one or more scheduling schemes 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, the method comprising:

• processing a first scheduling scheme with a second scheduling scheme, each of the scheduling schemes corresponding to a respective user;
• based on the processing, identifying a workforce insufficiency across the scheduling schemes;
• and
• generating one or more workforce augmentation suggestions to resolve the insufficiency.

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 and at least one of a target date, a classification, an associated application and an associated action, the first task and a set of the stored tasks each having a priority rank adjustment parameter associated therewith;
• 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;
• and
• render a visual depiction of the most recently defined scheduling scheme.