U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Method and system for production planning

Patent 5586021 Issued on December 17, 1996. Estimated Expiration Date: Icon_subject December 17, 2013. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Real world modeling and control process
Patent #: 4796194
Issued on: 01/03/1989
Inventor: Atherton

Expert system scheduler
Patent #: 5040123
Issued on: 08/13/1991
Inventor: Barber, et al.

Work scheduling method
Patent #: 5053970
Issued on: 10/01/1991
Inventor: Kurihara, et al.

Automated re-work shop order scheduling system
Patent #: 5099431
Issued on: 03/24/1992
Inventor: Natarajan

Manufacturing or service system allocating resources to associated demands by comparing time ordered arrays of data
Patent #: 5128860
Issued on: 07/07/1992
Inventor: Chapman

Expert system and method for batch production scheduling and planning
Patent #: 5148370
Issued on: 09/15/1992
Inventor: Litt, et al.

Dynamic scheduling
Patent #: 5212791
Issued on: 05/18/1993
Inventor: Damian, et al.

Fuzzy temporal control method Patent #: 5214773
Issued on: 05/25/1993
Inventor: Endo

Inventors

Assignee

Application

No. 857018 filed on 03/24/1992

US Classes:

700/100, Job scheduling700/121, Integrated circuit production or semiconductor fabrication705/7Operations research

Examiners

Primary: McElheny, Donald Jr.

Attorney, Agent or Firm

International Class

G06F 019/00

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.

Other References

  • "Stochastic Neural Networks for Solving Job-Shop Scheduling: Part 1, Problem Representation", Foo et al., IEEE Inter. Conf. on Neural Networks, Jul. 24-27, 1988, pp. II-275 through 282
  • "Stochastic Neural Networks for Solving Job-Shop Scheduling: Part 2. Architecture and Simulations", Foo et al. IEEE Inter. Conf. on Neural Networks, Jul. 24-27, 1988, pp. II-283 through 290
  • R. Kerr & R. Walker: "A Job Shop Scheduling System based on Fuzzy Arithmetic", Proc. of 3rd Int. Con. on Expert Systems & Leading Edge in Prod. & Operations Man., pp. 433-450, 198
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?