Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. 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.
A method for dynamically coordinating tasks involves receiving a new task with a priority and adjustment parameter, then creating a prioritized schedule by processing this task alongside existing tasks in a database. The system responds to status updates about tasks by dynamically creating a revised schedule to replace the previous one, optimizing task arrangement based on notification specifics (e.g., completion, modification). A third schedule considers priority adjustment parameters of individual tasks (time interval or date) to influence task ordering. The most recent schedule is displayed visually. This schedule accounts for task priorities and constraints, delivering an optimized arrangement.
2. The method of claim 1 , wherein the first task includes at least one of a target date, a classification, an associated application and an associated action and wherein said at least one of the target date, the classification, the associated application and the associated action are included in the visual depiction rendered at the computing device.
The task coordination method where a new task includes a target date, classification (business, personal), associated application, and action, where the display of the generated schedule also includes these details (target date, classification, application, action). This enhances the visual representation of task characteristics within the scheduling interface to provide more context and relevant information to the user.
3. The method of claim 2 , wherein at least one of the stored tasks is a fixed task.
The task coordination method including the display of task details, where at least one existing task in the database is a fixed task, meaning its scheduling is constrained or predetermined. This allows users to incorporate tasks with rigid time commitments into the dynamic scheduling system alongside more flexible tasks.
4. The method of claim 3 , further comprising processing a duration of time, the duration of time reflecting the time until the fixed task is scheduled, in order to generate a corresponding priority rank for the fixed task.
The task coordination method with fixed tasks, which includes processing a duration reflecting the time until the fixed task's scheduled time to generate a corresponding priority rank for the fixed task. This enables the system to dynamically adjust the priority of fixed tasks as their scheduled time approaches, ensuring that they are appropriately prioritized in the overall schedule, even if they are fixed.
5. The method of claim 2 , wherein the priority rank adjustment parameter comprises at least one of a time interval and a date, further comprising: changing the priority rank after the time interval has elapsed or the date has passed.
The task coordination method including the display of task details, where the priority rank adjustment parameter for a task includes a time interval or a date. The method further involves changing the priority rank of the task automatically after the time interval has elapsed or the specified date has passed. This allows for dynamic prioritization adjustments based on temporal factors.
6. The method of claim 2 , wherein the classification comprises at least one of business and personal.
The task coordination method including the display of task details, where the classification assigned to a task includes at least one of "business" and "personal". This allows users to categorize tasks and potentially manage schedules differently based on their classification type.
7. The method of claim 2 , wherein each scheduling scheme is associated with a classification, and wherein the processor is configured to generate plural first scheduling schemes, each corresponding to a particular classification.
The task coordination method including the display of task details, where each scheduling scheme is associated with a classification (business, personal), and the system can generate multiple initial schedules, each tailored to a specific classification. This allows users to create separate schedules for different aspects of their lives or work.
8. The method of claim 1 , wherein the status notification comprises at least one of: an indication of completion of a particular task, an instance of execution of the coordination application, an expiration of time, a passing of a date, an addition of a task, a deletion of a task, and a modification to at least one of the priority rank, the priority rank adjustment parameter, the target date, the classification, the associated application and the associated action of a particular task.
The task coordination method involves responding to a status notification, which includes: an indication of task completion, execution of the coordination application, expiration of time, passing of a date, task addition/deletion, or modifications to a task's priority, adjustment parameter, target date, classification, application, or action. The system dynamically reschedules based on these diverse status updates, ensuring relevance.
9. The method of claiml, wherein at least one of the first scheduling scheme and the second scheduling scheme comprises at least one of an ordered task listing and a task-populated calendar.
The task coordination method where at least one of the generated schedules (initial or revised) includes either an ordered list of tasks or a calendar populated with tasks. This provides the user with different visual formats to view and interact with their schedule.
10. The method of claim 1 , wherein at least one of the first scheduling scheme and the second scheduling scheme is generated based on a float percentage.
The task coordination method where at least one of the schedules (initial or revised) is generated based on a "float percentage." This float percentage influences how tasks are scheduled, potentially allowing for flexibility or buffer time in the schedule.
11. The method of claim 10 , wherein the float percentage comprises a multiplier that is applied against a duration parameter of at least one task.
The task coordination method using a float percentage for scheduling, where the float percentage is a multiplier applied to the duration of at least one task. This means task durations can be increased, building in some contingency or slack time in the schedule.
12. The method of claim 1 , wherein at least one of the first scheduling scheme and the second scheduling scheme are generated based on a time inventory.
The task coordination method where schedules (initial/revised) are generated based on a time inventory. This time inventory likely represents available time slots for scheduling tasks.
13. The method of claim 12 , wherein the time inventory corresponds to one or more classifications.
The task coordination method using a time inventory, where the time inventory corresponds to one or more task classifications (business, personal). This allows the system to track and manage time availability separately for different task categories.
14. The method of claim 1 , further comprising: identifying an insufficiency in the time inventory for allocation of one or more tasks; prompting a user to input one or more adjustments to address the insufficiency; receiving the one or more adjustments; and generating a further scheduling scheme to replace any prior scheduling scheme, the further scheduling scheme accounting for the received one or more adjustments.
The task coordination method includes identifying if the time inventory is insufficient for allocating tasks, prompting the user to make adjustments, receiving these adjustments, and generating a further schedule that takes these adjustments into account. The system addresses time constraints by soliciting and incorporating user input.
15. The method of claim 14 , wherein the one or more adjustments comprise adjustments to at least one of: a priority rank, a target date, a classification, a priority rank adjustment parameter, and a scheduling parameter.
The task coordination method for resolving time inventory insufficiencies through user adjustments, where adjustments include modifying a task's priority, target date, classification, priority rank adjustment parameter, or scheduling parameter. This gives users control over various factors influencing the scheduling of tasks when resources are limited.
16. The method of claim 1 , wherein at least one of the first scheduling scheme and the second scheduling scheme comprises at least one of an ordered task listing and a task-populated calendar.
The task coordination method where at least one of the generated schedules (initial or revised) includes either an ordered list of tasks or a calendar populated with tasks. This provides the user with different visual formats to view and interact with their schedule.
17. The method of claim 1 , 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, whereby the scheduling scheme of the first user is dynamically coordinated with the task assignment of from the second user.
The task coordination method also includes exposing a scheduling scheme of a first user to a second user, receiving a task assignment from the second user (which changes the first user's schedule), and processing the first user's schedule and the task assignment to generate a new schedule for the first user, allowing dynamic coordination between users.
18. The method of claim 17 , further comprising identifying an availability within the scheduling scheme of the first user.
The task coordination method including schedule sharing, also identifies availability within the first user's schedule. This availability is likely used to determine suitable times for the second user's task assignment.
19. The method of claim 18 , further comprising providing the second user with at least one scheduling opportunity for the task assignment based on the availability.
The task coordination method including schedule sharing and availability detection, further provides the second user with scheduling opportunities for the task assignment based on the identified availability in the first user's schedule. This facilitates efficient task assignment by leveraging existing free time.
20. The method of claim 19 , wherein the scheduling opportunity further accounts for a scheduling scheme of another user that is not the first user.
The task coordination method including scheduling opportunities, considers the scheduling scheme of another user (besides the first user) when offering scheduling opportunities for the task assignment. This enables coordination that accounts for multiple users' schedules, not just the first user and the assigning user.
21. 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.
A dynamic coordination system comprises a processor, memory, and a coordination application. The system interacts with a task database and dynamically generates schedules. The application receives a new task (with priority/adjustment), and a status notification from a user about existing/new tasks. It creates an initial schedule, then dynamically generates revised schedules: one based on priority adjustment parameters, another based on the status notification. The system visually displays the most recent schedule. The system optimizes task arrangements accounting for task priorities, constraints, and user feedback.
22. The system of claim 21 , wherein the first task includes at least one of a target date, a classification, an associated application and an associated action and wherein said at least one of the target date, the classification, the associated application and the associated action are included in the visual depiction rendered at the computing device by the coordination application.
The dynamic coordination system where the new task includes details like target date, classification (business/personal), associated application, and action. The visual display of the schedule also includes these details. This enriched display enhances user understanding and task management.
23. The system of claim 22 , wherein the classification comprises at least one of business and personal.
The dynamic coordination system with detailed task information, where the task classification can be either "business" or "personal." This categorization allows for schedule differentiation and potentially different scheduling rules based on classification.
24. The system of claim 21 , wherein the status notification comprises at least one of: an indication of completion of a particular task, an instance of execution of the coordination application, and a modification to at least one of the priority rank, the priority rank adjustment parameter, the target date, the classification, the associated application and the associated action of a particular task.
The dynamic coordination system responds to status notifications that include: task completion, execution of the coordination application itself, or modifications to task parameters (priority, adjustment, target date, classification, application, action). The system adjusts schedules dynamically based on these diverse notifications.
25. The system of claim 21 , wherein at least one of the first scheduling scheme, the second scheduling scheme, and the third scheduling scheme comprises at least one of an ordered task listing and a task-populated calendar.
The dynamic coordination system where the generated schedules (initial/priority-adjusted/status-adjusted) include either an ordered task list or a task-populated calendar. This gives users options for viewing and interacting with the generated schedules.
26. The system of claim 21 , wherein at least one of the first scheduling scheme and the second scheduling scheme comprises at least one of an ordered task listing and a task-populated calendar.
The dynamic coordination system where at least one of the first scheduling scheme and the second scheduling scheme comprises at least one of an ordered task listing and a task-populated calendar. This gives users options for viewing and interacting with the generated schedules.
27. The system of claim 21 , wherein the priority rank adjustment parameter comprises at least one of a time interval and a date, and wherein the coordination application further configures the control circuit to: change the priority rank after the time interval has elapsed or the date has passed.
The dynamic coordination system where the priority rank adjustment parameter is a time interval or date. The application automatically changes the task's priority rank after the time interval elapses or the date passes. This automated priority adjustment enables dynamic scheduling based on temporal factors.
28. The system of claim 21 , wherein each scheduling scheme is associated with a classification, and wherein the processor is configured to generate plural first scheduling schemes, each corresponding to a particular classification.
The dynamic coordination system where each scheduling scheme is associated with a classification (business, personal), and the system generates multiple initial schedules, each corresponding to a specific classification. This facilitates the creation of separate schedules tailored to different categories of tasks.
Unknown
November 18, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.