← Back to Patent Explorer
US5148370A Expired / Lapsed US ⏱️ 0.0 years remaining

Expert system and method for batch production scheduling and planning

Assignee: Standard Oil Co
•
Filing: 1991-06-26
•
Granted: 1992-09-15
•
Expires: 2011-06-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method employed by an expert system for batch scheduling the multiple-pass manufacture of a plurality of parts (12) by at least one parts process (22), where the parts (12) have a plurality of delivery dates and the parts (12) and parts processor (22) have a plurality of production constraints variable during manufacture, includes creating a knowledge base of select characteristics of the parts processor and parameters of the parts, and generating a plurality of rules expressing a scheduling and planning strategy that substantially satisfies parts delivery dates, substantially maximizes use of the parts processor, substantially maximizes part throughput, substantially minimizes energy utilization of the parts processor and meets the production constraints. Parts (12) suitable for simultaneous processing by the parts processor are combined into all possible preferred combinations by applying a first plurality of the rules to the knowledge base. Preferred combinations are scheduled for manufacture in batches by applying a second plurality of the rules to the knowledge base.

Inventors

  • 👤 Maria Litt
  • 👤 Jack C. Chung
  • 👤 Gary G. Leininger
  • 👤 David C. Bond

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 09:56
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06; G05; G05B; G05B13/00; G05B13/02; G05B13/0265; G05B13/028; G05B19/00; G05B19/02; G05B19/418; G05B19/41865; Y; Y02; Y02P; Y02P90/00; Y02P90/02; Y02P90/80; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/903; Y10S706/904

Claims Analysis

Total Claims: 47
Claim 1
Independent Claim 216 words
A method for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, the parts having a plurality of delivery dates and the parts and parts processor having a plurality of production constraints variable during manufacture, comprising: creating a knowledge base of select characteristics of the parts processor and parameters of the parts; generating a plurality of rules expressing a scheduling and planning strategy that substantially satisfies parts delivery dates and meets the production constraints; preparing parts for manufacture by the parts processor; combining parts suitable for simultaneous processing by the parts processor into all possible preferred combinations by applying a first plurality of said rules to said knowledge base; scheduling said preferred combinations for manufacture in batches by applying a second plurality of said rules to said knowledge base; collecting a plurality of said prepared parts in a first batch and loading said first batch in the parts processor; operating said parts processor to at least partially manufacture said first batch and thereafter inspecting said first batch for acceptable manufacture; and, manufacturing the remaining said preferred combinations in said scheduled batches, including the steps of repeating said step of combining parts suitable for simultaneous processing and said step of scheduling said preferred combinations where said manufacture of parts is unacceptable.
Claim 2
Independent Claim 216 words
A method for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, the parts having a plurality of delivery dates and the parts and parts processor having a plurality of production constraints variable during manufacture, comprising: creating a knowledge base of select characteristics of the parts processor and parameters of the parts; generating a plurality of rules expressing a scheduling and planning strategy that substantially satisfies parts delivery dates and meets the production constraints; preparing parts for manufacture by the parts processor; combining parts suitable for simultaneous processing by the parts processor into all possible preferred combinations by applying a first plurality of said rules to said knowledge base; scheduling said preferred combinations for manufacture in batches by applying a second plurality of said rules to said knowledge base; collecting a plurality of said prepared parts in a first batch and loading said first batch in the parts processor; operating said parts processor to at least partially manufacture said first batch and thereafter inspecting said first batch for acceptable manufacture; and, manufacturing the remaining said preferred combinations in said scheduled batches, including the steps of repeating said step of combining parts suitable for simultaneous processing and said step of scheduling said preferred combinations where said manufacture of parts is unacceptable.
Claim 3
Dependent Claim 65 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 1, wherein said step of generating a plurality of rules includes the step of generating a plurality of rules expressing a multiple-pass scheduling and planning strategy that additionally substantially maximizes use of the parts processor, substantially maximizes part throughput and substantially minimizes energy utilization of the parts processor.
Claim 4
Dependent Claim 49 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 2, wherein said step of combining parts includes the step of grouping the parts into components based upon said parameters preselected for identifying parts suitable for simultaneous manufacture by the parts processor.
Claim 5
Dependent Claim 62 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 3, wherein said step of combining parts further includes the step of collecting components into said preferred combinations based upon said parameters preselected for identifying components suitable for simultaneous manufacture by the parts processor and said characteristics preselected for maximizing utilization of the parts processor.
Claim 6
Dependent Claim 60 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 4, wherein said step of combining parts further includes the step of verifying said parameters in said knowledge base before said step of grouping the parts and said step of collecting components, said parameters including the readiness of each part for further processing.
Claim 7
Dependent Claim 48 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 5, wherein said step of combining parts further includes the step of assigning a priority to each part indicative of the urgency with which further processing of that part is required.
Claim 8
Dependent Claim 64 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 6, wherein parts are manufactured in at least one of a plurality of parts processors each having its own characteristics, and further including the step of selecting parts of the highest remaining priority prior to said step of grouping the parts and said step of collecting components.
Claim 9
Dependent Claim 83 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 7, wherein a first production constraint is that each parts processor is available at different and varying times, a second production constraint is that each part may be manufactured in only select part processors identified in said knowledge base, and said step of collecting components includes the step of collecting for one parts processor at a time, in a preselected order, components into said preferred combinations.
Claim 10
Dependent Claim 45 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 2, wherein said step of scheduling said preferred combinations for manufacture in batches includes the step of generating heuristically an optimal short-term schedule for the manufacture of parts.
Claim 11
Dependent Claim 65 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 9, wherein one of the production constraints is that the parts processor is available for manufacture only at certain varying times, and said step of generating heuristically an optimal short-term schedule includes the step of updating the time the parts processor is available for manufacture during the short-term.
Claim 12
Dependent Claim 60 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 10, wherein another of the production constraints is that at least one tool is required for manufacturing certain of the parts, and said step of generating heuristically an optimal short-term schedule further includes the step of updating the availability of all said tools.
Claim 13
Dependent Claim 47 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 11, wherein said step of generating heuristically an optimal short-term schedule further includes the step of selecting the next said preferred combination for which the required said tools are available.
Claim 14
Dependent Claim 64 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 12, wherein the step of generating heuristically an optimal short-term schedule further includes the steps of calculating the time required for manufacturing said selected preferred combination, and scheduling said selected preferred combination if the parts processor is available for sufficient time to manufacture said selected preferred combination.
Claim 15
Dependent Claim 55 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 13, wherein said step of generating heuristically an optimal short-term schedule further includes the step of repeating said step of combining parts if an additional part has been readied for manufacture during scheduling of said selected preferred combination.
Claim 16
Dependent Claim 75 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 14, wherein parts are manufactured in a plurality of parts processors each having its own characteristics, a first production constraint is that each parts processor is available at different and varying times, and said step of generating heuristically an optimal short-term schedule further includes the step of determining the next time the availability of any parts processor changes.
Claim 17
Dependent Claim 112 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 15, wherein a second production constraint is that each part may be manufactured in only select part processors identified in said knowledge base, and said step of generating heuristically an optimal short-term schedule further includes the step of selecting for one parts processor at a time the available preferred combinations until the availability of any parts processor changes or a preselected time limit is reached and the step of repeating said step of combining parts if preferred combinations remain unscheduled after the availability of any parts processor changes or said preselected time limit is reached.
Claim 18
Dependent Claim 46 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 2, wherein said step of scheduling said preferred combinations for manufacture in batches further includes the step of generating heuristically an optimal long-term schedule for the manufacture of parts.
Claim 19
Dependent Claim 46 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 17, wherein said step of generating heuristically an optimal long-term schedule further includes the step of updating the time the parts processor is available for manufacture during the long-term.
Claim 20
Dependent Claim 59 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 18, wherein the parts require partial manufacture other than by the parts processor with preselected time constraints, and said step of generating heuristically an optimal long-term schedule further includes the step of determining the readiness of each part requiring said partial manufacture.
Claim 21
Dependent Claim 61 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 19, wherein said step of generating heuristically an optimal long-term schedule further includes the step of generating heuristically an optimal short-term schedule for all ready parts, and the step of generating a schedule for said partial manufacture of all parts requiring said partial manufacture.
Claim 22
Dependent Claim 121 words
A method for batch scheduling and manufacturing of a plurality of parts, as set forth in claim 20, wherein parts are manufactured in a plurality of parts processors each having its own characteristics, a first production constraint is that each parts processor is available at different and varying times, a second production constraint is that each part may be manufactured in only select part processors identified in said knowledge base, and said step of generating heuristically an optimal long-term schedule further includes the step of inhibiting the scheduling of each part requiring said partial manufacture in all parts processors that do not have sufficient time remaining before they become unavailable to complete said partial processing and manufacture by that part processor.
Claim 23
Independent Claim 248 words
A system for batch scheduling and manufacturing of a plurality of parts having a plurality of delivery dates and a plurality of production constraints variable during manufacture, comprising: parts processor means for receiving and at least partially manufacturing the parts, said parts processor means having a plurality of production constraints variable during manufacture; means for preparing the parts for manufacture; knowledge base means for storing select characteristics of the parts processor and parameters of the parts; means for interpreting said characteristics and said parameters and generating a multiple-pass schedule to manufacture the parts in batches that substantially satisfies parts delivery dates, substantially maximizes use of the parts processor, substantially maximizes part throughput, substantially minimizes energy utilization of the parts processor and meets the production constraints, said means for interpreting said characteristics and said parameters including a first plurality of rules for combining parts suitable for simultaneous processing by the parts processor into all possible preferred combinations and a second plurality of rules for scheduling said preferred combinations for manufacture in batches; means for receiving said multiple-pass schedule and collecting a plurality of said prepared parts in a first batch, said parts processor means receiving and at least partially manufacturing said first batch; and, means for inspecting said manufactured first batch for acceptable manufacture; said parts processor means receiving and at least partially manufacturing the remaining said preferred combinations in said scheduled batches, said means for interpreting generating a further multiple-pass schedule where said manufacture of parts is unacceptable.
Claim 24
Independent Claim 248 words
A system for batch scheduling and manufacturing of a plurality of parts having a plurality of delivery dates and a plurality of production constraints variable during manufacture, comprising: parts processor means for receiving and at least partially manufacturing the parts, said parts processor means having a plurality of production constraints variable during manufacture; means for preparing the parts for manufacture; knowledge base means for storing select characteristics of the parts processor and parameters of the parts; means for interpreting said characteristics and said parameters and generating a multiple-pass schedule to manufacture the parts in batches that substantially satisfies parts delivery dates, substantially maximizes use of the parts processor, substantially maximizes part throughput, substantially minimizes energy utilization of the parts processor and meets the production constraints, said means for interpreting said characteristics and said parameters including a first plurality of rules for combining parts suitable for simultaneous processing by the parts processor into all possible preferred combinations and a second plurality of rules for scheduling said preferred combinations for manufacture in batches; means for receiving said multiple-pass schedule and collecting a plurality of said prepared parts in a first batch, said parts processor means receiving and at least partially manufacturing said first batch; and, means for inspecting said manufactured first batch for acceptable manufacture; said parts processor means receiving and at least partially manufacturing the remaining said preferred combinations in said scheduled batches, said means for interpreting generating a further multiple-pass schedule where said manufacture of parts is unacceptable.
Claim 25
Dependent Claim 72 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 22, wherein said means for interpreting said characteristics and said parameters and generating a schedule includes means for generating a multiple-pass schedule to manufacture parts in batches that additionally substantially maximizes use of the parts processor, substantially maximizes part throughput and substantially minimizes energy utilization of the parts processor.
Claim 26
Dependent Claim 57 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 23, wherein said first plurality of rules includes a plurality of rules for grouping the parts into components based upon said parameters preselected for identifying parts suitable for simultaneous manufacture by the parts processor.
Claim 27
Dependent Claim 70 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 24, wherein said first plurality of rules further includes a plurality of rules for collecting components into said preferred combinations based upon said parameters preselected for identifying components suitable for simultaneous manufacture by the parts processor and said characteristics preselected for maximizing utilization of the parts processor.
Claim 28
Dependent Claim 62 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 25, wherein said first plurality of rules further includes a plurality of rules for verifying said parameters in said knowledge base before grouping the parts and collecting components, said parameters including the readiness of each part for further processing.
Claim 29
Dependent Claim 56 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 26, wherein said first plurality of rules further includes a plurality of rules for assigning a priority to each part indicative of the urgency with which further processing of that part is required.
Claim 30
Dependent Claim 70 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 27, further including a plurality of parts processors for manufacturing parts, each said part processor having its own characteristics, and said first plurality of rules further includes a plurality of rules for selecting parts of the highest remaining priority prior to grouping the parts and collecting components.
Claim 31
Dependent Claim 93 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 28, wherein a first production constraint is that each said parts processor is available at different and varying times, a second production constraint is that each part may be manufactured in only select said part processors identified in said knowledge base, and said rules for collecting components includes a plurality of rules for collecting for one said parts processor at a time, in a preselected order, components into preferred combinations.
Claim 32
Dependent Claim 40 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 29, wherein each said parts processor is a furnace and said parts are fired in said furnaces.
Claim 33
Dependent Claim 48 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 23, wherein said second plurality of rules further includes a plurality of rules for generating heuristically an optimal shortterm schedule for the manufacture of parts.
Claim 34
Dependent Claim 73 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 31, wherein a first production constraint is that the parts processor is available for manufacture only at certain varying times, and said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for updating the time the parts processor is available for manufacture during the short-term.
Claim 35
Dependent Claim 67 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 32, wherein a second production constraint is that at least one tool is required for manufacturing certain of the parts, and said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for updating the availability of all said tools.
Claim 36
Dependent Claim 55 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 33, wherein said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for selecting the next said preferred combination for which the required said tools are available.
Claim 37
Dependent Claim 72 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 34, wherein said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for calculating the time required for manufacturing said selected preferred combination and scheduling said selected preferred combination if the parts processor is available for sufficient time to manufacture said selected preferred combination.
Claim 38
Dependent Claim 63 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 35, wherein said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for repeating said rules for combining parts if an additional part has been readied for manufacture during scheduling of said selected preferred combination.
Claim 39
Dependent Claim 85 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 36, further including a plurality of parts processors for manufacturing parts, each part processor having its own characteristics, a third production constraint is that each parts processor is available at different and varying times, and said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for determining the next time the availability of any parts processor changes.
Claim 40
Dependent Claim 122 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 37, wherein a forth production constraint is that each part may be manufactured in only select part processors identified in said knowledge base, and said rules for generating heuristically an optimal short-term schedule further includes a plurality of rules for selecting for one parts processor at a time the available preferred combinations until the availability of any parts processor changes or a preselected time limit is reached and a plurality of rules for repeating said rules for combining parts if preferred combinations remain unscheduled after the availability of any parts processor changes or said preselected time limit is reached.
Claim 41
Dependent Claim 40 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 38, wherein each said parts processor is a furnace and said parts are fired in said furnaces.
Claim 42
Dependent Claim 54 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 23, wherein said rules for scheduling said preferred combinations for manufacture in batches further includes a plurality of rules for generating heuristically an optimal long-term schedule for the manufacture of parts.
Claim 43
Dependent Claim 54 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 40, wherein said rules for generating heuristically an optimal long-term schedule further includes a plurality of rules for updating the time the parts processor is available for manufacture during the long-term.
Claim 44
Dependent Claim 67 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 41, wherein the parts require partial manufacture other than by the parts processor with preselected time constraints, and said rules for generating heuristically an optimal long-term schedule further includes a plurality of rules for determining the readiness of each part requiring said partial manufacture.
Claim 45
Dependent Claim 71 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 42, wherein said rules for generating heuristically an optimal long-term schedule further includes a plurality of rules for generating heuristically an optimal short-term schedule for all ready parts, and a plurality of rules for generating a schedule for said partial manufacture of all parts requiring said partial manufacture.
Claim 46
Dependent Claim 133 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 43, further including a plurality of parts processors, each said part processor having its own characteristics, a first production constraint is that each said parts processor is available at different and varying times, a second production constraint is that each part may be manufactured in only select said part processors identified in said knowledge base, and said rules for generating heuristically an optimal long-term schedule further includes a plurality of rules for inhibiting the scheduling of each part requiring said partial manufacture in all said parts processors that do not have sufficient time remaining before they become unavailable to complete said partial processing and manufacture by that said part processor.
Claim 47
Dependent Claim 40 words
A system for batch scheduling and manufacturing of a plurality of parts by at least one parts processor, as set forth in claim 44, wherein each said parts processor is a furnace and said parts are fired in said furnaces.

References Cited (Backward Citations)

US4459663A Cited
US4509123A Cited
US4646238A Cited
US4648023A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-09-15 1996-03-16 1996-09-15 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-09-15 2000-03-16 2000-09-15 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-09-15 2004-03-16 2004-09-15 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag