Abstract:
A Priority Rule Search Technique (PRST) heuristic computer controlled algorithm is disclosed that schedules single project, single resource and multiple project, multiple resource constrained project scheduling problems. Primary areas of utility include construction, manufacturing and research and development projects. The invention can schedule tasks/activities for large scale, multiple resource and multiple project networks that have different network and resource constraint characteristics while providing balance among different project network characteristics in order to provide an effective solution for a variety of network types. The novel PRST algorithm combines four heuristic rules (ACTM, LFT, MGRD and MACTRES) to determine a priority value for each job task/activity. The priority values are ranked to determine an optimum schedule of all job tasks and activities to complete the entire project. The invention incorporates the time (ACTM and LFT) and resource (MGRD and MACTRES) characteristics of project activities into a priority rule based search heuristic to determine an activity&#39;s priority for scheduling. The PRST scheduling invention is composed of four priority rules that are individually weighted and combined. The first two priority rules are ACTIM and Late Finish Time (LFT) heuristics. The second two priority rules allow for the allocating of limited resources to activities that cannot be scheduled concurrently. One of these priority rules designated Multiple Greatest Resource Demand (MGRD) modifies a Greatest Resource Demand heuristic to accommodate a multiple resource case. MGRD is scaled measure of the resource demanded for each activity. The second priority rule is designated Multiple ACTRESS (MACTRES) which modifies a ACTRES heuristic to accommodate the multiple resource case. MACTRES is a measure of the time and resources controlled by the activity through the network. Alternatively, the schedule of each of the job tasks/activities can be scheduled by ranking priority values based separately on MACTRES computations or MGRD calculations.

Description:
This invention relates to project scheduling and production methods and more specifically to a priority rule based heuristic algorithm for the efficient scheduling of single and multiple projects with single or multiple resource requirements. 
     BACKGROUND AND PRIOR ART 
     Large scale commercial construction projects and manufacturing projects typically require multiple resources needed to perform jobs that compose single or multiple projects. Thus, each of the jobs that compose these projects must be scheduled. A project can generally be defined as a nonrepetitive group of activities that are undertaken to accomplish an objective within a specific time limit and cost budget. Effective project management involves the balancing of activities and their budgets. Construction and high technology manufacturing projects typically pay significant bonuses for the early completion of a project. Likewise, construction and high technology manufacturing projects have penalties for a late finish. Generally, commercial construction and high technology projects are started based on bids. Thus, a shorter duration schedule by one bidder can be a tremendous competitive advantage over other bidders. Further, the entire time needed to finish a project can allow for a quicker entry into the market place by a manufacturer. Additionally, shorter duration schedules help minimize the risks of completing an expensive project by reducing the overall costs given today&#39;s high overhead cost for project development. 
     Typical amounts of scheduling solution time for a large construction and high technology project increase exponentionally with the size of the project due to many factors, of which the scheduling of individual job tasks with resource requirements is a paramount problem. The solution has been typically subject to the constraint that each job be scheduled for completion at or before some prescribed due time or as short a time after the due time is possible. Known practical solution methods generally fall into two categories, one category employing pure search techniques, e.g. branch-and-bound, and the other category using heuristic rules. The techniques in both categories are adapted for use on digital type computers. In spite of the effort to minimize the amount of computation, the known optimal search techniques suffer from excessive demands on computer time. 
     As to approaches using heuristic rules, most such approaches in the an are of the time-progression type where the solution schedule is generated step-by-step. At each step in the solution process, a queue of jobs waits to be initiated. The choice of which job to initiate next at each machine is based on heuristic rules, e.g. choose the job with the closest due time. While such heuristic approaches require less computing time as compared to the optimal search techniques, they fail to provide good schedules. One reason for the failure of such approaches is their failure to account for multiple resource requirements and to anticipate future bottlenecks. Examples of prior art systems having these problems includes U.S. Pat. Nos. 4,700,318; 4,896,269; 5,040,123; and 5,148,370. Existing Commercial Off The Shelf (COTS) Project software such as Microsoft Project and Artemis cannot be used with multiple project and multiple resource constraints on the project that needs scheduling. 
     SUMMARY OF THE INVENTION 
     The first objective of the present invention is to provide an algorithm for scheduling a plurality of projects each comprising multiple jobs or tasks. 
     The second object of this invention is to provide an algorithm that minimizes time duration project schedule for a sequence of job tasks. 
     The third object of this invention is to provide a project scheduling algorithm that looks ahead in time to anticipate and avoid infeasible schedules. 
     The fourth object of this invention is to provide a project scheduling heuristic that exploits the time and resource characteristics of project networks through the use of a priority rule based search technique. 
     The fifth object of this invention is to provide a scheduling algorithm for single resource requirements. 
     The sixth object of this invention is to provide a scheduling algorithm for multiple resource requirements. 
     The invention is a Priority Rule Search Technique (PRST) heuristic computer controlled algorithm that schedules single or multiple projects with single or multiple resource constraints. The invention incorporates the time and resource characteristics of project activities into a priority rule based search heuristic to determine an activity&#39;s priority for scheduling. Primary areas of utility include construction, manufacturing and research and development projects. The invention can schedule tasks/activities for large scale, multiple resource and multiple project networks that have different network and resource constraint characteristics while providing balance among different project network characteristics in order to provide an effective solution for a variety of network types. The invention incorporates the time and resource characteristics of project activities into a priority rule based search heuristic to determine an activity&#39;s priority for scheduling. The PRST scheduling invention is composed of four priority rules that are individually weighted and combined by an equal interval search technique. The first two priority rules are ACTIM and Late Finish Time (LFT) heuristics. The second two priority rules allows for the allocating of limited resources to activities that cannot be scheduled concurrently. One of these priority rules designated Multiple Greatest Resource Demand (MGRD) modifies a Greatest Resource Demand heuristic to accommodate a multiple resource case. MGRD is a scaled measure of the resource demanded for each activity. The second priority rule is designated Multiple ACTRES (MACTRES) which modifies an ACTRES heuristic to accommodate the multiple resource case. MACTRES is a measure of the time and resources controlled by the activity through the network. 
     Further objects and advantages of this invention will be apparent from the following detailed description of a presently preferred embodiment which is illustrated schematically in the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE FIGURES 
     FIG. 1A is the first half of a flowchart on the PRST project scheduling algorithm invention. 
     FIG. 1B is the second half of the flow chart on the PRST project scheduling algorithm invention. 
     FIG. 2 is a diagram illustration of a computing system on which the algorithm of the present invention can be successfully utilized. 
     FIG. 3 is an overview of activities/tasks that composes an exemplary project to be scheduled by the subject invention. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Before explaining the disclosed embodiment of the present invention in detail it is to be understood that the invention is not limited in its application to the details of the particular arrangement shown since the invention is capable of other embodiments. Also, the terminology used herein is for the purpose of description and not of limitation. 
     This PRST scheduling invention can be used in an algorithm form where priority rule values are determined for each activity and task that compose a project. The algorithm can be utilized by personal computers, workstations or mainframe computer systems such as but not limited to an IBM compatible 486, and the like. The methodology for implementation for any priority rule based heuristic scheduling method can be summarized as follows: 
     1. Solve a project network using the critical path method (chart the minimum tasks/activities sequential completion order (FIG. 3)) while tracking required completion times and resources for each activity and task. 
     2. Determine the priority rule values for each activity and task. 
     3. Rank the activities/tasks in order of the priority rule value. 
     4. Schedule the activities/tasks in priority order while maintaining the precedence relationships for the project network and satisfying resource constraints. 
     Priority rule values in the subject invention are determined by the novel PRST scheduling invention. The PRST scheduling invention is composed of four priority rules that are combined through an equal interval search technique. The first two priority rules are ACTIM and Late Finish Time (LFT) heuristics. The second two priority rules allow for the allocating of limited resources to activities that cannot be scheduled concurrently. One of these priority rules designated Multiple Greatest Resource Demand (MGRD) modifies a Greatest Resource Demand heuristic to accommodate a multiple resource case. MGRD is a scaled measure of the resource demanded for each activity. A second priority rule is designated Multiple ACTRES (MACTRES) which modifies a ACTRES heuristic to accommodate the multiple resource case. MACTRES is a measure of the time and resources controlled by the activity through the network. The four priority rules are combined through an equal interval search technique by linear weighting. The PRST priority value is computed as follows: 
     
         PRST=w x ACTIM)+(1-x)(MACTRES)!+(1-w) y(MGRD)+(1-y)(LFT)! 
    
     A description of the four priority rules will be followed by a preferred embodiment showing the flowchart for the PRST heuristic. 
     I. ACTIM. 
     ACTIM is the Critical Path Time minus the Latest Start Time of an activity. Thus, ACTIM is the maximum time each activity controls through a network on any one path. The critical path time and late start time for each activity are computed through application of the critical path method to the project network. Each job or activity would have an ACTIM value computed. The PRST algorithm utilizes this ACTIM value to help establish priorities among activities for scheduling purposes. 
     II. Late Finish Time (LFT). 
     Under LFT, priority is given to activities with the lowest value of late finish time. LFT is computed through application of the critical path method to the project network. Each job or activity would have a LFT value computed. The PRST algorithm utilizes this LFT value to help establish priorities among activities for scheduling purposes. 
     III. Multiple Greatest Resource Demand (MGRD). 
     MGRD modifies a Greatest Resource Demand (GRD) heuristic to accommodate a multiple resource case. MGRD is a scaled measure of the resource demanded for each activity. The GRD heuristic is computed by totaling all of the resource requirements for each activity. Each job or activity would have a GRD value computed. For MGRD, the GRD priority rule is modified specifically for the multiple resource case in two ways. The first modification consists of scaling the resource requirements. The scaling consists of assigning the maximum resources available for a resource type a value of 100 and then each resource requirement of that type for a given activity is appropriately scaled as a percentage of the maximum amount of available resources. For example, if a project had 10 units available for resource type B and activity one required nine units of resource type B, then its scaled resource consumption value would be 90. This feature is important because resource consumption levels among different resource types cannot be directly equated in a multiple resource project. 
     Note that even with appropriate scaling, the modified GRD only considers the total demand for resources. For example, if activity A required six units of resource from a single resource type, activity B requires two units of resource from three different resource types and activity C required one unit of resource from six different resource types, then all of the activities would have the same GRD value. It was hypothesized and proven that as the number of different resource types required by an activity requires increases, the greater will be the need to schedule that activity earlier. To reflect this priority, the modified GRD for each activity is multiplied by a resource type complexity factor designed as gamma (γ) prior to normalizing on a 0 to 100 scale over all activities. Gamma is assigned to be a non-decrementing function of the number of resource types. The resulting priority rule is designated as MGRD. In the example, the use of an increasing complexity factor γ would give additional priority to activity B and C in the scheduling sequence. Activity C would be ranked first, activity B second and activity A would be ranked third although all the activities require six total units of resource. 
     Each job or activity would have a MGRD value computed. The PRST algorithm utilizes this MGRD value to help establish priorities among activities for scheduling purposes. 
     IV. Multiple ACTRES (MACTRES). 
     MACTRES is a modification of the ACTRES priority role. ACTRES is computed by multiplying the activity duration by the number of resource units for that activity and then adding the maximum of the ACTRES values following that activity in the project network. Each job or activity would have a ACTRES value computed. ACNES is modified to incorporate multiple resource types by use of scaling in the same manner that MGRD accounts for multiple resources. The resources available for each resource type is assigned a value of 100. Each activity is assigned a resource value for each resource type in proportion to the resources required. The resource values are added for each activity and multiplied by the activity duration. The resulting products are normalized for all activities. The new version will be designated as MACTRES and is the activity duration multiplied by the sum of the scaled resource requirements for that activity and then adding the maximum MACTRES value following that activity. 
     Each job or activity would have a MACTRES value computed. The PRST algorithm utilizes this MACTRES value to help establish priorities among activities for scheduling purposes. 
     PRST ALGORITHM 
     For each job task we compute a priority rule value for each job task in accordance with the equation: 
     
         PRST=w x(ACTIM)+(1-x)(MACTRES)!+(1-w) y(MGRD)+(1-y)(LFT)! 
    
     where: 
     w=a variable that is incremented between 0 and 1 in order to conduct an equal interval search of PRST priority rule values for different values of w, x and y. 
     x=a variable that is incremented between 0 and 1 in order to conduct an equal interval search of PRST priority rule values for different values of w, x and y. 
     y=a variable that is incremented between 0 and 1 in order to conduct an equal interval search of PRST priority rule values for different values of w, x and y. 
     ACTIM=critical path time--Late Start Time for each activity 
     MACTRES=the activity duration multiplied by the sum of the scaled resource requirements for that activity and then adding the maximum MACTRES value following that activity. 
     MGRD=the sum of the scaled resource requirements for an activity multiplied by the resource type complexity factor for that activity. 
     LFT=Late Finish Time. 
     FIGS. 1A and 1B are used to run the PRST algorithm. FIG. 1A is the first half of a flowchart 100 on the PRST project scheduling algorithm invention. FIG. 1B is the second half of the flow chart 100 on the PRST project scheduling algorithm invention. In element 10, this step inputs the project network data, and precedence relationships and initializes program variables such as activity duration. In element 20, this step uses the data from step one to calculate the critical path of the network. In element 30, this step uses the project network critical path data and activity resource requirements to calculate the ACTIM, MACTRES, MGRD and LFT priority rule values for each activity. In element 40, this step sets each of the weighting variables for the equal interval search to zero. The variables will later be incremented independently in 0.1 increments until all three variables have a value of 1. Element 50, connects the steps from the page containing FIG. 1A to the page containing FIG. 1B. In element 60, this step checks to see if the w value is 1. The logic here is that if w=1, x and y are also 1 and the search is essentially complete and we transfer to element 170. If w is not 1, we go to element 70. In element 70, this step checks to see if the value of x is 1. If x is 1, we go to element 150, if not we go to element 80. In element 80, this step checks to see if the value of y is 1. If y is 1, we go to element 130, if not, we go to 90. In element 90, this step calculates the PRST priority rule value based on the current value of the variables w, x and y. In element 110, this step schedules the network based on the PRST priority rule values for each activity. In element 120, this step has the y value incremented by 0.1. In element 130, this step the x value is incremented by 0.1, the incremented weight is x by 0.1. In element 140, this step sets the y value to zero. In element 150, in this step the w value is incremented by 0.1. In element 160, this step sets the y and x value to zero. In element 170, this step essentially searches the one thousand project schedules generated for the one with minimum project duration. In element 180, this step prints the best schedule. 
     FIG. 2 is a diagram illustration of a computing system on which the PRST algorithm of the present invention 600 can be successfully utilized. The data input variables for the project to be scheduled above can be entered into the computer 640 through an input device such as a keyboard 610. The computer 640 used to execute the PRST algorithm can be an IBM PC/AT personal computer. A final conflict free schedule can be displayed on a CRT or graphics display 650 and/or printed out on a printer such as a Hewlett Packard Laser Printer and the like. The program embodying the novel PRST algorithm can be written in a conventional programming language such as &#34;C.&#34; 
     The precedence relationship of an example project will be shown in FIG. 3. Referring to FIG. 3, the numbers and letters inside the circles represent each activity and task that composes the project. The term activity and task will be used interchangeably here. For purposes of this example, the FIG. 3 project can be a construction project that includes: 
     A1=Dummy Start Task Set to 0, 
     B2=Laying the foundation, 
     C3=Constructing roof trusses, 
     D4=Pouring cement for the driveway, 
     ES=Raising the walls, 
     F6=Raising the roof, and 
     G7=Dummy finish task set to 0. 
     The arrows coming from an activity indicate the activities that succeed that activity. The arrows going into an activity indicate the activities that precede an activity. The resource requirements for each activity in the project are shown below: 
     
                       TABLE 1______________________________________Activity Activity Resource   Resource                               ResourceNumber   Duration Type 1     Type 2 Type 3______________________________________A1       0        0          0      0B2       1        2          2      1C3       2        0          2      1D4       2        3          3      3E5       3        2          1      3F6       2        1          1      0G7       0        0          0      0______________________________________ 
    
     The columns of the resource requirements are defined as follows: 
     Activity Duration=Time requirement amount required to perform an activity/task in a uniform unit amount (i.e., hr., sec. etc.) 
     Resource Type# is what type of resource is necessary to do the work (i.e., for example: Resource Type 1 can be Trucks, Resource Type 2 can be workers, Resource Type 3 can be money) 
     In the above table Activity B2 had an Activity Duration of 1 time unit, and required 2 trucks (Resource Type 1), 2 unskilled laborers (Resource Type 2), and 1 craftsman (Resource Type 3). 
     The activity duration and precedence relationships allow for the application of the critical path method for the unconstrained resource case (unlimited resource availability). The critical path method results in the following values for early start time, late start time and late finish time: 
     
                       TABLE 2______________________________________Activity Early Start  Late Start                          Late FinishNumber   Time         Time     Time______________________________________A1       0            0        0B2       0            0        1C3       0            2        4D4       1            4        6E5       1            1        4F6       4            4        6G7       6            6        6______________________________________ where: Early Start Time =0 The earliest time you cant start an activity/task. Late Start Time = The latest time you can start an activity/task. Late Finish Time = The latest time an activity/task can be finished. 
    
     The resource availability (Total Number of particular Resource Type available) for this project is as follows: 
     
         ______________________________________Resource       Resource ResourceType 1         Type 2   Type 3______________________________________5              5        3______________________________________ 
    
     (Thus, if Resource Type 1 is trucks, then there are 5 trucks available for the project) 
     The PRST algorithm can now be computed. PRST is composed of the four priority rules ACTIM, MACTRES, MGRD and LFT. We would first compute the values of these priority rules for each activity in the network. 
     ACTIM is equivalent to scheduling by LST so the ACTIM values for the network would be equivalent to LST. Once these values are determined they are normalized on a zero to 100 scale so they may be combined effectively via linear weighting. The values for the network are shown in the following table. 
     
                       TABLE 3______________________________________Activity    Late Start                NormalizedNumber      Time     ACTIM (Late Start Time)______________________________________A1          0        0B2          0        0C3          2        33D4          4        67E5          1        17F6          4        67G7          6        100______________________________________ 
    
     MACTRES is the activity duration multiplied by the activity resource requirements plus the maximum ACTRES value following that activity. Before the duration can be multiplied by the resource requirements those requirements must be combined. The first step in combining the resource requirements is to normalize them in comparison to the resource availability for that resource type on a zero to 100 scale. For example, if an activity required 5 units of resources of resource type 1 and ten units of resource type 1 were available, it would have a value of 50 for resource type 1. This normalized value would then be summed with the other resource types for the activity. The table below shows these normalizing calculations for resource computation for each activity in the network. 
     
                       TABLE 4______________________________________    Resource     Resource NormalizedActivity Type 1       Type 1   ResourceNumber   Required     Available                          Type 1______________________________________A1       0            5        0B2       2            5        40C3       0            5        0D4       3            5        60E5       2            5        40F6       1            5        20G7       0            5        0______________________________________ 
    
     
                       TABLE 5______________________________________    Resource     Resource NormalizedActivity Type 2       Type 2   ResourceNumber   Required     Available                          Type 1______________________________________A1       0            5        0B2       2            5        40C3       2            5        40D4       3            5        60E5       1            5        20F6       1            5        20G7       0            5        0______________________________________ 
    
     
                       TABLE 6______________________________________    Resource     Resource NormalizedActivity Type 3       Type 3   ResourceNumber   Required     Available                          Type 3______________________________________A1       0            3        0B2       1            3        30C3       1            3        30D4       3            3        100E5       3            3        100F6       0            3        0G7       0            3        0______________________________________ 
    
     
                       TABLE 7______________________________________  Normalized            Normalized  Normalized                                SummedActivity  Resource  Resource    Resource                                ResourceNumber Type 1    Type 1      Type 3  Value______________________________________A1     0         0           0       0B2     40        40          30      110C3     0         40          30      70D4     60        60          100     220E5     40        20          100     160F6     20        20          0       40G7     0         0           0       0______________________________________ 
    
     The summed resource values are now multiplied by the activity duration for each activity. The results are in the table below. 
     
                       TABLE 8______________________________________                          Resources                 Summed   MultipliedActivity Activity     Resource byNumber   Duration     Value    Duration______________________________________A1       0            0.0      0.0B2       1            1.1      1.1C3       2            0.7      1.4D4       2            2.2      4.4E5       3            1.6      4.8F6       2            0.4      0.8G7       0            0.0      0.0______________________________________ 
    
     We now add the resources multiplied by duration to the largest resources multiplied by duration of all activities successors in the network and then normalize these activities for the final MACTRES values for each activity as shown in the able below. 
     
                       TABLE 9______________________________________  Resources Largest    Raw     NormalizedActivity  Multiplied            Following  MACTRES MACTRESNumber By Duration            Value      Value   Value______________________________________A1     0.0       6.7        6.7     100B2     1.1       5.6        6.7     100C3     1.4       0.8        2.2     33D4     4.4       0          4.4     66E5     4.8       0.8        5.6     84F6     0.8       0          0.8     12G7     0.0       0          0.0     0______________________________________ 
    
     MGRD is the greatest resource demand heuristic. It is computed by using the summed resources taken from table 8 and multiplying those factors by a resource type complexity factor that provides increased priority to activities that require more different types of resources. 
     
                       TABLE 10______________________________________                       After                       Application                       of Resource  Summed   Number of   Type    NormalizedActivity  Resource Resource    Complexity                               MGRDNumber Value    Types       Factor  Value______________________________________A1     0        0           0       0B2     110      3           119     50C3     70       2           73      31D4     220      3           238     100E5     160      3           173     73F6     40       2           42      18G7     0        0           0       0______________________________________ 
    
     LFT values were determined through application of the critical path method. These values just need to be normalized so they can be effectively combined via linear weighting. 
     
                       TABLE 11______________________________________Activity      Late Finish                   NormalizedNumber        Time      LFT______________________________________A1            0         0B2            1         17C3            4         67D4            6         100E5            4         67F6            6         100G7            6         100______________________________________ 
    
     We have now obtained all of the priority rule values which are shown in the table below. 
     
                       TABLE 12______________________________________  Normalized            Normalized Normalized                               NormalizedActivity  ACTM      MACTRES    MGRD    LFTNumber Value     Value      Value   Value______________________________________A1     0         100        0       0B2     0         100        50      17C3     33        33         31      67D4     67        66         100     100E5     17        84         73      67F6     67        12         18      100G7     100       0          0       100______________________________________ 
    
     We can now use the PRST algorithm and begin the equal interval search technique. As you recall, PRST is defined as follows: 
     
         PRST=w x(ACTIM)+(1-x)(MACTRES)!+(1-w) y(MGRD)+(1-y)(LFT)! 
    
     The equal interval search technique is implemented by setting the values of w, x, and y equal to zero and stepping through in 0.1 increments from 0 to 1. At each increment a schedule is generated and the schedule length is determined. The schedule with the lowest length is then used as the basis for determining activity sequence. For example with w=0.8, x=0.2, and y=0.5. PRST would be computed for each activity. Activity 3&#39;s PRST value would be computed as follows: 
     
         PRST=0.8 0.2(ACTIM)+(1-0.2)(MACTRES)!+ 1-0.8 ! 0.5 (MGRD)+(1-.05)(LFT)! 
    
     substituting in the priority rule values for activity 3. 
     
         PRST=0.8 0.2(33)+(1-0.2)(33)!+ 1-0.8! 0.5(31)+(1-0.5)(67)! 
    
     
         PRST=36 
    
     This raw value of PRST would then be normalized on a 0 to 100 scale along with all the other PRST values for the other activities. The activities would then be scheduled in PRST order as their early start time permits. (This means the precedence relationship of the project cannot be violated, i.e., you cannot put the roof of the house up before you install the walls). 
     With an increment value of 0.1, 1000 schedules would be generated. The shortest schedule would then be outputted with the sequence including start and finish times for each activity. 
     
         ______________________________________Activity      PRST Start                   PRSTNumber        Time      Finish Time______________________________________A1            0         0B2            0         1C3            0         1D4            5         5E5            5         7F6            2         7G7            7         7______________________________________ 
    
     Note the finish time of the last activity is the finish time of the project In this case, the finish time is 7 time units. This happens to be the optimal (best achievable) finish time for this particular problem. The optimal solution for this problem can be computed because of its small size. 
     While the preferred embodiment describes ranking priority values based on the novel PRST algorithm, the invention can generate a project schedule based on other priority values. The calculations separately determined by computing MACTRES values or MGRD values can also be ranked to determine a project schedule of the job tasks and activities. 
     Utilizing a computer system of this type, the jobs or tasks that compose a project can be scheduled in a matter of minutes. The schedule would show the sequence and start and finish times for each activity. 
     The invention has utility as a Commercial Off The Shelf (COTS) Project software by itself or as an add-on to existing software packages such as Microsoft Project 22B or Artemis. 
     While the invention has been described, disclosed, illustrated and shown in various terms of certain embodiments or modifications which it has presumed in practice, the scope of the invention is not intended to be, nor should it be deemed to be, limited thereby and such other modifications or embodiments as may be suggested by the teachings herein are particularly reserved especially as they fall within the breadth and scope of the claims here appended.