Method for resource allocation and project control for the production of a product

Claim 1

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating a external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining said external component slack value that is most late, determining dates of actual start of said activities and entering said date of actual start into said memory bank of said computer, calculating an internal slack value for each activity having an actual start date internally in said computer following programmed instructions, said internal slack value being equal to said baseline schedule date for the start of said activity minus the actual start date of said activity, said computer retrieving from said memory bank previously entered said baseline schedule date and actual start date for each said activity, said computer storing said internal slack values in said memory bank, determining said internal slack value that is most late, determining the project most late slack value by comparing said most late component slack value and said most late internal slack value, determining a projected final completion date by subtracting the project most late slack value from said desired final completion date on said network, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values and said internal slack values, increasing resources allocated to external components and activities having most late slack values.

Claim 2

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating a external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining said external component slack value that is most late, determining dates of actual start of said activities and entering said date of actual start into said memory bank of said computer, calculating an internal slack value for each activity having an actual start date internally in said computer following programmed instructions, said internal slack value being equal to said baseline schedule date for the start of said activity minus the actual start date of said activity, said computer retrieving from said memory bank previously entered said baseline schedule date and actual start date for each said activity, said computer storing said internal slack values in said memory bank, determining said internal slack value that is most late, determining the project most late slack value by comparing said most late component slack value and said most late internal slack value, determining a projected final completion date by subtracting the project most late slack value from said desired final completion date on said network, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values and said internal slack values, increasing resources allocated to external components and activities having most late slack values.

Claim 3

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating a external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining, for each activity, a most late external component slack value from among said component slack values for components required for said activity, determining, for each activity, an internal slack value for a most late internal constraint on beginning said activity, determining, for each activity, an activity most late slack value from among said most late external component slack value and said internal slack value, calculating a projected activity beginning date by subtracting said activity most late slack value from said baseline schedule date for the beginning of said activity, displaying said projected activity beginning date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values and said internal slack values, increasing resources allocated to external components and activities having most late slack values.

Claim 4

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating a external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining, for each activity, a most late external component slack value from among said component slack values for components required for said activity, determining, for each activity, an internal slack value for a most late internal constraint on beginning said activity, determining, for each activity, an activity most late slack value from among said most late external component slack value and said internal slack value, calculating a projected activity beginning date by subtracting said activity most late slack value from said baseline schedule date for the beginning of said activity, displaying said projected activity beginning date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values and said internal slack values, increasing resources allocated to external components and activities having most late slack values.

Claim 5

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating an external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining a most late external component slack value, calculating a projected final completion date by subtracting said most late component slack value from said desired final completion date, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values, increasing resources allocated to external components having most late slack values.

Claim 6

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, identifying external components required to support each activity and entering external component identification and corresponding activity into said memory bank of said computer, determining an availability date for each said component and entering said availability date into said memory bank of said computer, calculating an external component slack value for each said component internally in said computer following programmed instructions, said component slack value being equal to the baseline schedule date for the start of the activity requiring said component minus the availability date of said component, said computer retrieving from said memory bank previously entered said baseline schedule date and said availability date for each said component, said computer storing said component slack values in said memory bank, determining a most late external component slack value, calculating a projected final completion date by subtracting said most late component slack value from said desired final completion date, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said external component slack values, increasing resources allocated to external components having most late slack values.

Claim 9

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, determining dates of actual start of said activities and entering said date of actual start into said memory bank of said computer, calculating an internal slack value for each activity having an actual start date internally in said computer following programmed instructions, said internal slack value being equal to said baseline schedule date for the start of said activity minus the actual start date of said activity, said computer retrieving from said memory bank previously entered said baseline schedule date and actual start date for each said activity, said computer storing said internal slack values in said memory bank, determining a most late internal slack value, calculating a projected final completion date by subtracting said most late internal slack value from said desired final completion date, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said internal slack values, increasing resources allocated to activities having most late slack values.

Claim 10

A method for the manufacture of a product, comprising: generating a network of activities required to manufacture a product, estimating a time duration for each activity, choosing a desired final completion date for completion of manufacturing, calculating a baseline schedule date for the start of each said activity, said baseline schedule date for the start of each prior activity being equal to the baseline schedule date for the start of the following activity in said network minus said estimated time duration of said prior activity, said desired final completion date being the last baseline schedule date in said network, entering said baseline schedule date corresponding to each said activity into a memory bank of a digital computer, determining dates of actual start of said activities and entering said date of actual start into said memory bank of said computer, calculating an internal slack value for each activity having an actual start date internally in said computer following programmed instructions, said internal slack value being equal to said baseline schedule date for the start of said activity minus the actual start date of said activity, said computer retrieving from said memory bank previously entered said baseline schedule date and actual start date for each said activity, said computer storing said internal slack values in said memory bank, determining a most late internal slack value, calculating a projected final completion date by subtracting said most late internal slack value from said desired final completion date, displaying said projected final completion date on an output device of said computer, manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state, allocating said resources in said manufacturing based on said internal slack values, increasing resources allocated to activities having most late slack values.