Abstract: Some embodiments of the present invention provide systems and techniques for collecting task status information. During operation, the system can receive a status update for a task from a task manager through a GUI. Next, the system can determine whether the first status update for the task indicates that the task is delayed. If the status update indicates that the task is delayed, the system can request the task manager to indicate the help needed to resolve the task delay. Next, the system can receive a help needed descriptor from the task manager. Subsequently, the system can receive another status update for the task from the task manager, wherein the status update indicates that the help specified in the help needed descriptor is no longer required. Next, the system can determine an amount of delay associated with the help needed descriptor.

Abstract: Some embodiments of the present invention provide systems and techniques for determining a start delay and an execution delay for a task. During operation, the system can receive a status update for the task which indicates that the task has started execution. Next, the system can receive a second status update for the task which indicates that the task has completed execution. The system can then determine the start delay for the task by: determining an actual start time using the first status update; and determining a difference between the actual start time and the task's suggested start time. Next, the system can determine the execution delay for the task by: determining an actual execution duration using the first status update and the second status update; and determining a difference between the actual execution duration and the task's planned execution duration.

Abstract: Methods and apparatuses are described for creating and using full-kit tasks, monitoring the progress of full-kit tasks, determining full-kit dates, checking compliance of release conditions associated with full-kit tasks, and/or computing and reporting full-kit task delays. A full-kit task can be used in the project plan to represent the preparations that are required or recommended to be performed before executing a set of tasks. The full-kit task can be a zero-duration task that has a full-kit date and that includes a list of items which need to be completed by the full-kit date. The full-kit task is capable of being in one of the following states: not started, in progress, released, and completed. In some embodiments, the set of tasks associated with the full-kit task can only be started if the full-kit task is either in the released state or the completed state.

Abstract: Methods and apparatuses are described for creating and using full-kit tasks, monitoring the progress of full-kit tasks, determining full-kit dates, checking compliance of release conditions associated with full-kit tasks, and/or computing and reporting full-kit task delays. A full-kit task can be used in the project plan to represent the preparations that are required or recommended to be performed before executing a set of tasks. The full-kit task can be a zero-duration task that has a full-kit date and that includes a list of items which need to be completed by the full-kit date. The full-kit task is capable of being in one of the following states: not started, in progress, released, and completed. In some embodiments, the set of tasks associated with the full-kit task can only be started if the full-kit task is either in the released state or the completed state.

Abstract: Methods and apparatuses are described for creating and using full-kit tasks, monitoring the progress of full-kit tasks, determining full-kit dates, checking compliance of release conditions associated with full-kit tasks, and/or computing and reporting full-kit task delays. A full-kit task can be used in the project plan to represent the preparations that are required or recommended to be performed before executing a set of tasks. The full-kit task can be a zero-duration task that has a full-kit date and that includes a list of items which need to be completed by the full-kit date. The full-kit task is capable of being in one of the following states: not started, in progress, released, and completed. In some embodiments, the set of tasks associated with the full-kit task can only be started if the full-kit task is either in the released state or the completed state.

Abstract: A method on a computer for providing critical chain-based project management across a plurality of projects is disclosed. The method includes generating a plurality of plans, each of the plurality of plans corresponding to one of the plurality of projects, wherein a project comprises at least one task. The method further includes generating buffers for each of the plurality of projects and reconciling project resources among the plurality of projects. The method further includes executing the plurality of project plans, including allowing a user to manage the buffers across the plurality of projects. The user is further provided with information associated with buffers for the plurality of projects, so as to evaluate the status of the plurality of projects. Additionally, the user is provided with task prioritization for any task of the plurality of projects, wherein task prioritization is calculated across the plurality of projects.

Abstract: Some embodiments of the present invention provide systems and techniques for determining a start delay and an execution delay for a task. During operation, the system can receive a status update for the task which indicates that the task has started execution. Next, the system can receive a second status update for the task which indicates that the task has completed execution. The system can then determine the start delay for the task by: determining an actual start time using the first status update; and determining a difference between the actual start time and the task's suggested start time. Next, the system can determine the execution delay for the task by: determining an actual execution duration using the first status update and the second status update; and determining a difference between the actual execution duration and the task's planned execution duration.

Abstract: Some embodiments of the present invention provide systems and techniques for collecting task status information. During operation, the system can receive a status update for a task from a task manager through a GUI. Next, the system can determine whether the first status update for the task indicates that the task is delayed. If the status update indicates that the task is delayed, the system can request the task manager to indicate the help needed to resolve the task delay. Next, the system can receive a help needed descriptor from the task manager. Subsequently, the system can receive another status update for the task from the task manager, wherein the status update indicates that the help specified in the help needed descriptor is no longer required. Next, the system can determine an amount of delay associated with the help needed descriptor.

Abstract: Some embodiments provide a system for determining an aggregate delay associated with a task attribute value. During operation, the system can receive a set of projects, which include completed projects and currently executing projects. Next, the system can determine buffer consumption amounts associated with task chains in each project. A task chain can be a sequence of tasks in the project's task dependency network which ends in the project buffer. The buffer consumption amount associated with a task chain can be the amount of the project buffer that would have been consumed if the tasks in the task chain were the only tasks in the project. Next, the system can select a set of task chains based at least on the buffer consumption amounts. The system can then aggregate task delays for tasks in the set of task chains that are associated with the task attribute value.

Abstract: A method on a computer for providing critical chain-based project management is disclosed. The method includes generating a list of sequential time periods for a project comprising a plurality of tasks and calculating a number of tasks for each time period. The method further includes generating a graphic that visually indicates the number of tasks for each time period and a priority of each task and providing the graphic to a user.

Abstract: Some embodiments provide a system for scheduling multiple projects. During operation, the system can receive a set of projects. Each project can be associated with a due date, and can include a group of tasks whose interdependencies are representable using a task dependency network. Next, the system can associate at least some tasks in some of the projects with a phase. The system can then determine project start times and project end times for at least some projects in the set of projects so that the aggregate weight of the projects that are in the phase at any given time is less than or equal to a work-in-process (WIP) limit associated with the phase. The system can also impose resource usage constraints. Further, the system can enable the user to evaluate the impact on the project schedules if the duration of one or more phases is changed.

Abstract: A method on a computer for providing critical chain-based project management is disclosed. The method includes receiving at least one project plan for a project comprising a plurality of tasks and calculating a task priority for each of the plurality of tasks based on the at least one project plan. The method further includes receiving at least one sub-task for a first task of the plurality of tasks and assigning the at least one sub-task a task priority identical to the task priority of the first task. In one alternative, the method further includes receiving a new task priority for the first task, assigning the new task priority to the first task and assigning the new task priority to the at least one sub-task of the first task. The method may also include an interface to allow starting of sub-tasks only when the parent task is started.

Abstract: A method on a computer for providing critical chain-based project management across a plurality of projects is disclosed. The method includes generating a plurality of plans, each of the plurality of plans corresponding to one of the plurality of projects, wherein a project comprises at least one task. The method further includes generating buffers for each of the plurality of projects and reconciling project resources among the plurality of projects. The method further includes executing the plurality of project plans, including allowing a user to manage the buffers across the plurality of projects. The user is further provided with information associated with buffers for the plurality of projects, so as to evaluate the status of the plurality of projects. Additionally, the user is provided with task prioritization for any task of the plurality of projects, wherein task prioritization is calculated across the plurality of projects.

Abstract: A method on a computer for providing critical chain-based project management is disclosed. The method includes generating a list of sequential time periods for a project comprising a plurality of tasks and calculating a number of tasks for each time period. The method further includes generating a graphic that visually indicates the number of tasks for each time period and a priority of each task and providing the graphic to a user.

Abstract: A method on a computer for providing critical chain-based project management is disclosed. The method includes receiving at least one project plan for a project comprising a plurality of tasks and calculating a task priority for each of the plurality of tasks based on the at least one project plan. The method further includes receiving at least one sub-task for a first task of the plurality of tasks and assigning the at least one sub-task a task priority identical to the task priority of the first task. In one alternative, the method further includes receiving a new task priority for the first task, assigning the new task priority to the first task and assigning the new task priority to the at least one sub-task of the first task. The method may also include an interface to allow starting of sub-tasks only when the parent task is started.

Abstract: A method on a computer for providing critical chain-based project management across a plurality of projects is disclosed. The method includes generating a plurality of plans, each of the plurality of plans corresponding to one of the plurality of projects, wherein a project comprises at least one task. The method further includes generating buffers for each of the plurality of projects and reconciling project resources among the plurality of projects. The method further includes executing the plurality of project plans, including allowing a user to manage the buffers across the plurality of projects. The user is further provided with information associated with buffers for the plurality of projects, so as to evaluate the status of the plurality of projects. Additionally, the user is provided with task prioritization for any task of the plurality of projects, wherein task prioritization is calculated across the plurality of projects.