US5826040A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for production planning
Assignee: Texas Instruments Inc
•
Filing: 1995-12-13
•
Granted: 1998-10-20
•
Expires: 2015-12-13
Abstract
Abstract A method for planning a production schedule within a factory is disclosed herein. A capacity model is determined for the factory. The capacity model is determined by determining a plurality of contiguous time intervals, partitioning the factory into a plurality of resource groups, and determining a processing capacity for each of the resource groups for each of the time intervals. For each job to be planned, the job is divided into a plurality of processing segments each of which is represented with a corresponding fuzzy set. The fuzzy set representations are inserted and removed within the capacity model until the job is planned. A completion date and a confidence level can be predicted for each of the jobs. In addition, the jobs may be released to the factory and devices fabricated according to the requirements of the jobs. Other systems and methods are also disclosed.
Inventors
- 👤 Hugh E. Fargher
- 👤 Richard A. Smith
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 13:14
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06; G05; G05B; G05B19/00; G05B19/02; G05B19/418; G05B19/41865; G06Q10/063; G06Q10/0631; G06Q10/06314; G06Q10/06315; Y; Y02; Y02P; Y02P90/00; Y02P90/02; Y02P90/80
Claims Analysis
Total Claims: 21
Claim 1
Independent Claim
137 words
A computer implemented method for planning a production schedule within a factory comprising the steps of: determining said capacity model for said factory, said step of determining said capacity model comprising the steps of: determining a plurality of contiguous time intervals; partitioning said factory into a plurality of resource groups; and determining a processing capacity for each of said resource groups for each of said contiguous time intervals; for each job to be planned, dividing said job into a plurality of processing segments; representing each of said processing segments with a corresponding fuzzy set; inserting and removing said fuzzy set within said capacity model until said job is planned; predicting a completion date and a confidence level for each of said jobs and scheduling each of said jobs based on said completion date and said confidence level.
Claim 2
Dependent Claim
137 words
A computer implemented method for planning a production schedule within a factory comprising the steps of: determining said capacity model for said factory, said step of determining said capacity model comprising the steps of: determining a plurality of contiguous time intervals; partitioning said factory into a plurality of resource groups; and determining a processing capacity for each of said resource groups for each of said contiguous time intervals; for each job to be planned, dividing said job into a plurality of processing segments; representing each of said processing segments with a corresponding fuzzy set; inserting and removing said fuzzy set within said capacity model until said job is planned; predicting a completion date and a confidence level for each of said jobs and scheduling each of said jobs based on said completion date and said confidence level.
Claim 3
Dependent Claim
33 words
The computer implemented method of claim 1, wherein said method further comprises the steps of: releasing said job to said factory; and fabricating devices within said factory according to requirements of said job.
Claim 4
Dependent Claim
18 words
The computer implemented method of claim 2, wherein said method further comprises the step of fabricating semiconductor wafers.
Claim 5
Dependent Claim
20 words
The computer implemented method of claim 1, wherein said method further comprises the step of substantially equaling said time intervals.
Claim 6
Dependent Claim
25 words
The computer implemented method of claim 1, wherein said partitioning step comprises the step of placing a single machine into at least two resource groups.
Claim 7
Dependent Claim
47 words
The computer implemented method of claim 1, wherein the step of representing each of said processing segments with a corresponding fuzzy set comprises the step of decomposing a final cycle time probability distribution into interval cycle time distributions for each successive time interval of said time intervals.
Claim 8
Dependent Claim
31 words
The computer implemented method of claim 6, wherein said method further comprises the step of increasing a variance of said interval cycle time distributions in accordance with said successive time interval.
Claim 9
Dependent Claim
30 words
The computer implemented method of claim 6, wherein said method further comprises the step of bounding each of said interval cycle time distributions by said final cycle time probability distribution.
Claim 10
Dependent Claim
27 words
The computer implemented method of claim 6, wherein said decomposition step comprises the step of performing fuzzy arithmetic operations to decompose said final cycle time probability distribution.
Claim 11
Dependent Claim
25 words
The computer implemented method of claim 1, wherein said inserting and removing step comprises the step of performing a modified beam search with chronological back-tracking.
Claim 12
Dependent Claim
41 words
The computer implemented method of claim 10, wherein the step of performing a modified beam search comprises the step of determining a maximum value of a beam width by a ratio of measured job cycle to a minimum theoretical cycle time.
Claim 13
Dependent Claim
26 words
The computer implemented method of claim 10, wherein the step of performing comprises the step of constraining said beam width to increase linearly with search depth.
Claim 14
Dependent Claim
102 words
A computer system for planning a production schedule within a factory comprising: circuitry for determining a capacity model for said factory; a memory device for storing said capacity model; circuitry for dividing a job to be planned into a plurality of processing segments; circuitry for representing each of said processing segments with a corresponding fuzzy set; circuitry for inserting and removing said fuzzy set within said capacity model until said job is planned; circuitry for predicting a completion date and a confidence level for said job; circuit for scheduling each of said jobs based on said completion date and said confidence level.
Claim 15
Dependent Claim
102 words
A computer system for planning a production schedule within a factory comprising: circuitry for determining a capacity model for said factory; a memory device for storing said capacity model; circuitry for dividing a job to be planned into a plurality of processing segments; circuitry for representing each of said processing segments with a corresponding fuzzy set; circuitry for inserting and removing said fuzzy set within said capacity model until said job is planned; circuitry for predicting a completion date and a confidence level for said job; circuit for scheduling each of said jobs based on said completion date and said confidence level.
Claim 16
Dependent Claim
15 words
The computer system of claim 13, wherein said memory device comprises a random access memory.
Claim 17
Dependent Claim
25 words
The computer system of claim 13, wherein said factory comprises a plurality of machines and said machines are partitioned into a plurality of resource groups.
Claim 18
Dependent Claim
24 words
The computer system of claim 15, wherein a machine of said plurality of machines is placed into at least two of said resource groups.
Claim 19
Dependent Claim
14 words
The computer system of claim 13 wherein said system is implemented in a microcomputer.
Claim 20
Dependent Claim
15 words
The computer system of claim 17, wherein said microcomputer comprises a reduced instruction set computer.
Claim 21
Dependent Claim
13 words
The computer system of claim 18, wherein said microcomputer comprises a Sparc microprocessor.
References Cited (Backward Citations)
US4796194A
Cited
US5148370A
Cited
US5053970A
Cited
US5128860A
Cited
US5214773A
Cited
US5040123A
Cited
US5212791A
Cited
US5099431A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-19 | 2002-04-20 | 2002-10-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-19 | 2006-04-20 | 2006-10-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-19 | 2010-04-20 | 2010-10-20 | $7700.00 | Window Closed / Lapsed |