Method for resource allocation for the manufacture of a product

• US 4,648,023 A
• Filed: 04/27/1986
• Issued: 03/03/1987
• Est. Priority Date: 05/23/1985
• Status: Expired due to Term

• Current Assignee: Roger A. Powell
• Original Assignee: Roger A. Powell
• Inventors: Powell, Roger A.
• Primary Examiner(s): Smith, Jerry
• Assistant Examiner(s): MacDonald, Allen
• Application Number:
  US06/869,450
• Time in Patent Office: 310 Days
• Field of Search: 364/148, 364/150, 364/153, 364/154, 364/155, 364/156, 364/401, 364/402, 364/200, 364/900
• US Class Current: 700/36
• CPC Class Codes: G05B 19/41865 characterised by job scheduling, process planning, material flow
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 10/0875 Itemisation or classification of parts, supplies or services, e.g. bill of materials
• CPC Class Codes: Y02P 90/02 Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Abstract

A control system for the manufacture of small-order-quantity goods. A network of events, activities and baseline schedule dates is constructed. Availability of external components and actual internal progress are measured by a slack variable. Optimization is based on use of the slack variable for allocation of resources. Critical items are determined rapidly and in parallel. Cost estimation of schedule improvements are readily determined.

Claims

1. A method for manufacturing a product, comprising:

generating a network of activities required to manufacture said product,

estimating a time duration for each activity,

determining a desired final completion date for completion of said manufacturing,

calculating a baseline schedule date for each said activity, said baseline schedule date for each prior activity being equal to the baseline schedule date for 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,

identifying components required to complete each said activity,

determining an availability date for each said component,

assigning to each component said baseline schedule date for said activity requiring said component,

calculating a time difference between said availability date and said baseline schedule date for each component, said time difference being a measure of lateness of said availability date with respect to said baseline schedule date for each component,

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 time differences, thereby refining said manufacturing step.

2. A method for manufacturing a product as recited in claim 1, wherein said resources include productive time at individual work stations, and wherein said allocating assigns priority to said components being most late as measured by said time differences.

3. A method for manufacturing a product as recited in claim 1, wherein said resources include additional reserves of manpower and machine time and wherein said allocating commits said reserves to said components being most late as measured by said time differences.

4. A method for manufacturing a product as recited in claim 1, further comprising:

determining a trigger-level of lateness as measured by said time differences;

comparing said time differences for each component with said trigger-level, thereby determining components having lateness exceeding said trigger-level;

wherein said allocating concentrates said resources on components having lateness exceeding said trigger-level.

5. A method for manufacturing a product as recited in claim 1, further comprising:

determining a set of components being most late as determined by said time differences;

determining costs required to make earlier the availability date for each component in said set;

summing said costs across said components in increments of degrees of lateness as measured by said time differences.

6. A method for manufacturing a product, comprising:

generating a network of activities required to manufacture said product,

estimating a time duration for each activity,

determining a desired final completion date for completion of said manufacturing,

calculating a baseline schedule date for each said activity, and baseline schedule date for each prior activity being equal to the baseline schedule date for 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,

manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state,

determining dates of actual performance of said activities,

calculating a time difference between said date of actual performance and said baseline schedule date for each activity, said time difference being a measure of lateness of said date of actual performance with respect to said baseline schedule date for each activity,

allocating said resources in said manufacturing based on said time differences, thereby refining said manufacturing step.

7. A method for manufacturing a product as recited in claim 6, wherein said resources include manpower and equipment, and wherein said allocating assigns additional resources to said activities being most late as measured by said time differences.

8. A method for manufacturing a product as recited in claim 6, wherein said allocating diverts resources away from activities being least late as measured by said time differences.

9. A method for manufacturing a product, comprising:

generating a network of activities required to manufacture said product,

estimating a time duration for each activity,

determining a desired final completion date for completion of said manufacturing,

calculating a baseline schedule date for each said activity, said baseline schedule date for each prior activity being equal to the baseline schedule date for 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,

identifying components required to complete each said activity,

determining an availability date for each said component,

assigning to each component said baseline schedule date for said activity requiring said component,

calculating a time difference between said availability date and said baseline schedule date for each component, said time difference being a measure of lateness of said availability date with respect to said baseline schedule date for each component,

manufacturing said product, said manufacturing applying resources to transform an article from an initial state into a different final state,

determining dates of actual performance of said activities,

calculating a time difference between said date of actual performance and said baseline schedule date for each activity, said time difference being a measure of lateness of said date of actual performance with respect to said baseline schedule date for each activity,

allocating said resources in said manufacturing based on said time differences, thereby refining said manufacturing step, said allocating directing a larger share of said resources to activities and components being most late as measured by said time differences.

10. A method for manufacturing a product as recited in claim 9, further comprising:

determining a set of components being most late as determined by said time differences;

determining costs required to make earlier the availability date for each component in said set;

summing said costs across said components in increments of degrees of lateness as measured by said time differences.

11. A method for manufacturing a product as recited in claim 9, wherein at least one calculating step is performed by a digital computer.