Method and system of planning and scheduling that incorporates inheritance, feedback learning, path optimization, and simulation

Abstract

Embodiments disclose a system and method for planning and scheduling, comprising connecting a single or plurality of similar computer systems via a local, private, or public network, creating or instantiating a plan a plan or plans, wherein the said plan is comprised within a tackle, and wherein the plan comprises a single or plurality of recursive child plans, allowing for organization, linking, interfacing and inheritance of a plurality of plans, a single or plurality of items, and for organization, linking, interfacing and inheritance of said items, performing an operation or operations on each item wherein each item can be broken up, perfected, integrated, or tackled, and wherein the encoded instructions further cause the computer system to request assignment through a series of assigning users, with the final assigning user assigning the first item for a first user who commits to the assignment of the first item; wherein the first user commits to constructing the item by providing a commitment duration range of time becoming the assigned user; delivering the constructed item by the assigned user to one or more receiving users; each receiving user accepting and rejecting the constructed item by the assigning user; and the system recording and storing critical analytics with respect to construction of the assigned item and its' delivery relative to the specified duration range; with an ability to modify given protocol between users on demand.

What is claimed is: 
     
         1 . A computer automated system for planning and scheduling, comprising a processing unit coupled to a memory element and having instructions encoded thereon, wherein the encoded instructions cause the system to: connect to a single of plurality of similar computer systems via a local, private, or public network; and wherein the encoded instructions cause the single or plurality of computer systems to:
 create or instantiate a plan, wherein the said plan is comprised within a tackle, and wherein the plan comprises a single or plurality of recursive child plans, allowing for organization, linking, interfacing and inheritance of a plurality of plans, a single or plurality of items, and for organization, linking, interfacing and inheritance of said items;   perform an operation or operations on each item wherein each item can be broken up, perfected, integrated, or tackled; and wherein the encoded instructions further cause the computer system to:   request assignment through a series of assigning users, with the final assigning user assigning the first item to a first user who commits to the assignment of the first item;
 wherein the first user commits to constructing the item by providing a commitment duration range of time, becoming the assigned user; 
   deliver the constructed item by the assigned user to one or more receiving users;   accept or reject the delivered constructed item by the one or more receiving users;   record and store critical analytics with respect to construction of the assigned item and its' delivery relative to the specified duration range; and   modify given protocol between users.   
     
     
         2 . The system of  claim 1  wherein the breaking of each item further comprises breaking the item into smaller items optionally with plans until the elemental items are determined. 
     
     
         3 . The system of claim  2 wherein the breaking of each item further comprises a means for allowing decomposition, tree creation, and resource allocation dynamically and asynchronously. 
     
     
         4 . The system of  claim 3  wherein the system is further caused to calculate a result for the said breaking of each item, in real time. 
     
     
         5 . The system of  claim 1  wherein the system is further caused to:
 construct a set of nodes interconnected with edges in a mathematical graph form; 
 wherein the edges indicate dependencies; 
 wherein the mathematical graph form further comprises a local starting point or points and a corresponding local ending point or points, that may be linked, instantiated or cloned 
 wherein the nodes represent ‘items’ or ‘activities’ which imply a noun or verb, task or an action. 
 
     
     
         6 . The computer system of  claim 1  wherein the encoded instructions cause the system to:
 create a data structure or structures comprising means for storing a single or plurality of information types for and relevant to an interaction subsequent to creating an item or items; 
 wherein the data structures are comprised in a simulation algorithm that comprises means to compile and simulate continuously, providing real time statistical updates; and 
 wherein the information type comprises at least one of images, video, audio, and textual data. 
 
     
     
         7 . The system of  claim 6  wherein the encoded instructions further cause the computer system to:
 combine statistical data of events that have occurred, with metrics of results of algorithms which offer possibilities of future events such that the combination of past, present, and future predictive data from algorithmic sources enables processing each tackle in the context of algorithms applied. 
 
     
     
         8 . The system of  claim 7  wherein the encoded instructions further cause the system to:
 couple structural diagrams of Tackles, Plans, Items and Edges, with Interaction Diagram protocols and data, to generate past and current analytics, and project future analytics in the form of statistics. 
 
     
     
         9 . The system of  claim 7  wherein the encoded instructions further cause the system to:
 couple structural diagrams of Tackles, Plans, Items and Edges, with Interaction Diagram protocols data, and then using a predictive algorithm based on User history and Project History, to generate future analytics in the form of projected statistics. 
 
     
     
         10 . The system of  claim 1  wherein the encoded instructions further cause the system to:
 receive a duration range request for an item or plan; 
 based on the context and history of the item or plan, calculate the duration distribution; 
 return the calculated duration distribution in response to the received duration range request. 
 
     
     
         11 . In a computer automated system comprising a processing unit coupled to a memory element and having instructions encoded thereon, and connected to a single or plurality of similar computer systems over a network, a method for planning and scheduling, comprising:
 allowing the creation or instantiation of a plan, wherein the said plan is comprised within a tackle, and wherein the plan comprises a single or plurality of recursive child plans, and further allowing for the organization, linking, interfacing, and inheritance of said plans, and organization, linking, interfacing and inheritance of a single or plurality of items;   performing an operation or operations on each item wherein each item can be broken up, perfected, integrated, or tackled; and wherein the method further comprises:   requesting assignment through a series of assigning users, with the final assigning user assigning the first item for a first user who commits to the assignment of the first item;
 wherein the first user commits to constructing the item by providing a commitment duration range of time, becoming the assigned user; 
   delivering the constructed item by the assigned user to one or more receiving users;   accepting or rejecting the delivered constructed item by the one or more receiving users;   recording and storing critical analytics with respect to construction of the assigned item and its' delivery relative to the specified duration range; and   modifying given protocol between users.   
     
     
         12 . The method of  claim 11  wherein the breaking of each item further comprises breaking the item into smaller items until the elemental items are determined. 
     
     
         13 . The method of  claim 12  wherein the breaking of each item further comprises a means for allowing decomposition, tree creation, and resource allocation dynamically and asynchronously. 
     
     
         14 . The method of  claim 13  further comprising calculating a result for the said breaking of each item, in real time. 
     
     
         15 . The method of  claim 11  further comprising:
 constructing a set of nodes interconnected with edges in a mathematical graph form; 
 wherein the edges indicate dependencies; 
 wherein the mathematical graph form further comprises a local starting point or points and a corresponding local ending point or points, that may be linked, instantiated or cloned; 
 wherein the nodes represent ‘items’ or ‘activities’ which imply a ‘noun’ or verb, task or an action. 
 
     
     
         16 . The method of  claim 11  further comprising:
 creating a data structure or structures comprising means for storing a single or plurality of information types for and relevant to an interaction subsequent to creating an item or items; 
 wherein the data structures are comprised in a simulation algorithm that comprises means to provide real time statistical updates; and wherein the said information types comprise at least one of images, video, audio, or textual data. 
 
     
     
         17 . The method of  claim 16  further comprising:
 combining statistical data of events that have occurred, with metrics of results of algorithms which offer possibilities of future events such that the combination of past, present, and future data enables processing each tackle in the context of algorithms applied. 
 
     
     
         18 . The method of  claim 17  further comprising:
 coupling structural diagrams of Tackles, Plans, Items and Edges, with Interaction Diagram data, to generate past and current analytics in the form of statistics. 
 
     
     
         19 . The method of  claim 17  further comprising:
 coupling structural diagrams of Tackles, Plans, Items and Edges, with Interaction Diagram data, and then using a predictive algorithm based on User history and Project History, to generate future analytics in the form of projected statistics. 
 
     
     
         20 . The method of  claim 11  further comprising:
 receiving a duration range request for an item or plan; 
 based on the context and history of the item or plan, calculating the duration distribution; and 
 returning the calculated duration distribution in response to the received duration range request.