Dual path scheduling method

Details Dual path scheduling method Dual path scheduling method

2000-06-22

2004-03-30

Picard, Leo (Department: 2125)

Data processing: generic control systems or specific application

Specific application, apparatus or process

Product assembly or manufacturing

C705S002000, C705S002000, C715S252000

Reexamination Certificate

active

06714829

ABSTRACT:

TECHNICAL FIELD
This invention relates to a method of scheduling a project consisting of a plurality of tasks. The invention is applicable, for example, to building construction projects.
BACKGROUND OF THE INVENTION
Building projects and other types of projects as well are of a multi-task nature; that is, completion of the project from beginning to end is accomplished by carrying out a plurality of established tasks, the tasks often being of an interrelated nature requiring an established sequence or prioritization.
A number of approaches ranging from semi-formal to formal have been devised and employed in the past to schedule tasks of a multi-task project. Prior art approaches can be relatively inefficient and do not necessarily lend themselves to efficient and proper management of a project, particularly where a large number of sub-projects are involved, as in carrying forward a subdivision construction project. In addition, recording of such schedules utilizing prior approaches can be complicated and complex, yet still not function as an efficient tool providing the information desired to properly plan, evaluate and manage a project. Nor do conventional prior art scheduling approaches provide good bases for analyzing past activities so that performance improvements can be made in the future.
DISCLOSURE OF INVENTION
The present invention relates to a scheduling method which provides a highly effective management tool. The method is relatively simple as compared to often complicated prior art scheduling methods and there is no need for employing bar charts or similar graphic displays to provide the desired information. Utilizing the method of the present invention, the critical path of the project is brought into clear focus for effective schedule management purposes.
The present invention encompasses a method of scheduling a project consisting of a plurality of tasks and includes the step of identifying critical tasks of the project.
The method also includes identifying para-critical tasks of the project.
The critical tasks are displayed in a visually perceptible manner with the critical tasks ranked in chronological order.
The identified para-critical tasks are displayed in a visually perceptible manner adjacent to the displayed critical tasks.
Target finish dates are established for the displayed critical tasks and a target finish date is displayed for each of the displayed critical tasks adjacent to the respective displayed critical task.
The performance of the displayed critical tasks is monitored to establish actual completion dates of the displayed critical tasks and the actual completion date of each displayed critical task is displayed adjacent to the associated displayed critical task upon completion thereof.
The target finish dates for all subsequent displayed critical tasks are adjusted to reflect any variance between the target finish date and the actual finish date of a displayed critical task.
The method also includes the step of notifying parties responsible for completion of at least one of the displayed tasks of the target start dates thereof.


REFERENCES:
patent: 5745110 (1998-04-01), Ertemalp
patent: 5890134 (1999-03-01), Fox
patent: 6256651 (2001-07-01), Tuli
patent: 2002/0077879 (2002-06-01), Uchida et al.
patent: 2002/0169647 (2002-11-01), Newbold

Affiliated with

Also associated with

Rating

Dual path scheduling method does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dual path scheduling method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dual path scheduling method will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3224146