Abstract: A scheduling system and method provides a strategy for an interactive and automated summarized source network schedule on a time-scaled graph of a digital canvas that includes a hierarchy of schedule densities generated from source child activities. As the time-scaled graph is time compressed, the source child activities snap into parent activities of a higher hierarchy level such that the source child activities become visually non-present on the digital canvas and the parent activities of the higher hierarchy level becomes visually present on the digital canvas. As the time-scaled graph is time-stretched, the source child activities that are associated with the parent activities of the hierarchy level that is currently visible on the digital canvas snap out of the parent activities and become visually present on the digital canvas and the parent activities become visually non-present.

Abstract: An interactive and automated summarized schedule on a digital canvas includes a hierarchy of logic-tied schedule densities generated from source schedule activities and for which there is the ability in real-time to zoom in/out among the hierarchy of logic-tied schedule densities. For example, the hierarchy of logic-tied schedule densities is generated in response to and as the timescale (e.g., grid spacing) is compressed or stretched. This permits users to “zoom in” and “zoom out” on the digital canvas to observe the schedule activities individually or at various levels of summary groups that are summed-up from underlying individual activities, all while maintaining logic-relationships between the summarized groups.

Abstract: A computer-implemented method for interactively authoring a layout of a network includes providing a network of activities, embedded nodes, milestones, benchmarks, and links between at least a portion of the activities, milestones, and benchmarks; identifying a plurality of activity clusters from the activities, each such activity cluster comprising a sequence of linked, contiguous activities in the network; and placing, as a group, the activities of each of the activity clusters on a display grid upon which the network is laid out.

Abstract: A computer-implemented simulation method for analyzing schedule risk in a graphical schedule that includes (a) providing a base schedule that has graphical schedule objects including activities that are connected in a logic network by logic ties, the schedule culminating in a completion milestone, (b) sampling from probability distributions representing uncertainties in the durations of the activities to simulate activity durations from start dates to finish dates, (c) modifying the start date of one of the activities as a function of float or drift of the activity, and (d) using the logic ties, the sampled activity durations, and the modified start date to determine an output representing a simulated occurrence of the base schedule culminating in the completion milestone.

Abstract: This invention relates to providing a system for project planning and scheduling which supports simplified, interactive, graphics-based project planning and scheduling using new planning concepts, new scheduling concepts and new graphics-based software systems. Further, this invention permits an inexperienced user to simultaneously plan and schedule a project including establishing appropriate relationship (or dependency) links between activities, also commonly referred to as tasks, and between activities and milestones. This invention offers the simplest possible scheme of thought that can tie together activities, relationships and milestones, with or without deadlines, to yield a complete, correct network project schedule in the shortest possible time.

Abstract: A graphical forensic scheduling system is described. The system may receive a data date on a time-scaled project schedule. The system may calculate link gaps based on predecessor and successor relevant dates on either side of the data date. The system may automatically correct logic ties if actual dates for related activities are out-of-sequence. The system may calculate and display forensic floats, forensic drifts, and forensic total floats for actualized activities based on an algorithmic function of all link gaps on either side of the data date, i.e. forensic gap or otherwise. The as-built critical path may be determined based on the forensic total floats. The system may continuously and automatically refresh in real-time, forensic float, forensic drift and forensic total float any time a gap on either side of the data date takes on a revised value due to activities being repositioned on the timescale.

Abstract: A graphical planning and scheduling system is described. The system is based on the Graphical Planning Method and object oriented principles. The system is graphics-driven and may support gestural and surface computing. The system may allow resource leveling, schedule optimization, and time/cost tradeoffs to occur interactively on a display and in conjunction with network construction. The system may allow forward and backward planning and scheduling of projects. The system may also allow project stakeholders to interactively participate in collaborative planning and scheduling sessions.

Abstract: This invention relates to providing a system for project planning and scheduling which supports simplified, interactive, graphics-based project planning and scheduling using new planning concepts, new scheduling concepts and new graphics-based software systems. Further, this invention permits an inexperienced user to simultaneously plan and schedule a project including establishing appropriate relationship (or dependency) links between activities, also commonly referred to as tasks, and between activities and milestones. This invention offers the simplest possible scheme of thought that can tie together activities, relationships and milestones, with or without deadlines, to yield a complete, correct network project schedule in the shortest possible time.