Patent US2922355A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5229948A Expired / Lapsed US ⏱️ 0.0 years remaining

Method of optimizing a serial manufacturing system

Assignee: Research Foundation of the State University of New York
•
Filing: 1990-11-03
•
Granted: 1993-07-20
•
Expires: 2010-11-03
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of optimizing a multi-stage serial manufacturing system which includes: (a) providing a quantitative state-space model of said serial manufacturing system that describes processing in terms of sensitivity information and performance in terms of part production and storage/retrieval, said description using process switches in the form of buffer status indicators that express coupling between stages; (b) sensing new sensitivity information that results from simulating said manufacturing system with said model using estimated system performance information; and (c) adjusting said performance information by iteratively using said new sensitivity information in an optimization algorithm, said adjustment being carried out simultaneously with the simulation of step (b).

Inventors

  • 👤 Kuang C. Wei
  • 👤 Norman C. Otto

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 17:50
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/06; G05; G05B; G05B19/00; G05B19/02; G05B19/418; G05B19/41885; Y; Y02; Y02P; Y02P90/00; Y02P90/02

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 139 words
A method of optimizing a multi-stage serial manufacturing system, comprising: (a) providing a quantitative state-space model of said serial manufacturing system that describes processing in terms of stages, sensitivity information for blocking or starving of such stages, and performance information in terms of part production and buffer storage/retrieval, said description using process switches in the form of buffer status indicators that express coupling between stages; (b) using estimated performance information, including buffer size, to simulate said manufacturing system with said model and sensing new sensitivity information that results therefrom; and (c) concurrently adjusting said performance information, including buffer size, by iteratively using said new sensitivity information in an optimization algorithm to estimate a gradient of the performance information with respect to buffer size and thence adjust buffer size, and repeating steps (b) and (c) until the gradient substantially stabilizes.
Claim 2
Independent Claim 139 words
A method of optimizing a multi-stage serial manufacturing system, comprising: (a) providing a quantitative state-space model of said serial manufacturing system that describes processing in terms of stages, sensitivity information for blocking or starving of such stages, and performance information in terms of part production and buffer storage/retrieval, said description using process switches in the form of buffer status indicators that express coupling between stages; (b) using estimated performance information, including buffer size, to simulate said manufacturing system with said model and sensing new sensitivity information that results therefrom; and (c) concurrently adjusting said performance information, including buffer size, by iteratively using said new sensitivity information in an optimization algorithm to estimate a gradient of the performance information with respect to buffer size and thence adjust buffer size, and repeating steps (b) and (c) until the gradient substantially stabilizes.
Claim 3
Dependent Claim 26 words
The method as in claim 1, in which said serial manufacturing system is subject to random effects or variable multiple inputs accompanied by multiple random outputs.
Claim 4
Dependent Claim 27 words
The method as in claim 1, in which said state-space model is a set of mathematical quantitative equations expressing the dynamic behavior of the serial manufacturing system.
Claim 5
Dependent Claim 33 words
The method as in claim 3, in which said state-space model expresses coupling between buffer input processes, cross-coupling between input and output processes, and embedding of an operation rule to resolve contention issues.
Claim 6
Dependent Claim 30 words
The method as in claim 1, in which in step (a) processing is characterized as a function of cycle rate, time, buffer status indicator as well as workpieces being produced.
Claim 7
Dependent Claim 15 words
The method as in claim 5, in which said processing can vary linearly or discontinuously.
Claim 8
Dependent Claim 34 words
The method as in claim 1, in which in step (a) said part production is the sum of total pieces at one previous instant added to the fractional workpieces at a current instant time.
Claim 9
Dependent Claim 25 words
The method as in claim 1, in which in step (a) said storage/retrieval is a set of cross-coupled equations describing input stock and output stock.
Claim 10
Dependent Claim 49 words
The method as in claim 8, in which the input stock is equal to the sum of whole stock from previous stages added to the fractional stock completed upstream to be entered, added to the whole stock just out, added to the other sources or sinks of whole stock.
Claim 11
Dependent Claim 51 words
The method as in claim 8, in which said output stock is the sum of the whole stocks from previous stages, less fractional stock yet to be completed by the downstream machine, but added to the whole stock just in, and added to the other sources or sinks of whole stock.
Claim 12
Dependent Claim 37 words
The method as in claim 1, in which in step (a) said buffer status indicator is equal to the value of zero, if the buffer is empty or full, and equal to the value of one, otherwise.
Claim 13
Dependent Claim 30 words
The method as in claim 1, in which in step (b) said sensitivity information is a proposed change in system performance variables in response to changes in processing parameter values.
Claim 14
Dependent Claim 25 words
The method as in claim 1, in which said selected production rate is comprised of a minimum rate defined in terms of per hour/per shift.
Claim 15
Dependent Claim 32 words
The method as in claim 1, in which in step (b) said buffer space is the space for inventory between stages and can be either of the crossover type or parallel type.
Claim 16
Dependent Claim 27 words
The method as in claim 1, in which in step (c) said gradient estimator is used, which is a derivative of the function that is being optimized.

References Cited (Backward Citations)

US4604718A Cited
US4710864A Cited
US4796194A Cited
US4744027A Cited
US4998051A Cited
US5057992A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-07-19 1997-01-18 1997-07-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-07-19 2001-01-18 2001-07-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-07-19 2005-01-18 2005-07-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag