Patents by Inventor Yi-Chin Hsu

Yi-Chin Hsu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7389249
    Abstract: An automated supply management system for dynamically fulfilling a customer requested order having an order fulfillment system for fulfilling a plurality of customer requests in accordance with a plurality of processing capacity restraints defined for a plurality of pieces of manufacturing equipment disposed within a manufacturing facility; an allocation planning system for receiving a plurality of capacity modeling data from the order fulfillment system, an order management system for communicating a plurality of consumption data and a customer requested due date to the order fulfillment system, wherein the order management system requests the customer requested due date and receives a calendar date of production available to promise from the order fulfillment system; and a manufacturing planning system for receiving an order fulfillment matrix from the order fulfillment system.
    Type: Grant
    Filed: June 11, 2003
    Date of Patent: June 17, 2008
    Assignee: Taiwan Semiconductor Manufacturing Co., Ltd.
    Inventors: Chih-Yi Hsu, Yi-Chin Hsu, Yi-Cherng Wang
  • Publication number: 20050144056
    Abstract: A method of capacity reservation. The inventive method first obtains historical customer delivery data, classifies the customers into different category levels according to the delivery data, and reserves capacity for the customer categories accordingly.
    Type: Application
    Filed: December 29, 2003
    Publication date: June 30, 2005
    Inventors: Chung-Wen Wang, Yi-Chin Hsu
  • Patent number: 6871110
    Abstract: A method and system is provided for dynamically coordinating one or more product orders with product parts progressing through a manufacturing process flow. After identifying a first order for generating one or more lots of parts for manufacturing a first product, wherein the first order identifies a predetermined base feature, one or more customer specific features, one or more order specific features, and the quantity of the first product, A smart code is assigned to the first order and the lots of parts, wherein the smart code identifies an association between the first order and the lots of parts. An analysis is then performed, based on the smart codes assigned thereto, to see whether one or more available lots of parts of a second order in production are ready to be converted to produce the first product. The smart code of the available lots is changed to the smart code of the first order if the available lots of the second order are chosen to be further processed for fulfilling the first order.
    Type: Grant
    Filed: September 5, 2003
    Date of Patent: March 22, 2005
    Assignee: Taiwan Semiconductor Manufacturing Co., Ltd.
    Inventors: Wei-Kuo Yen, Yi-Chin Hsu, Cheng-Che Chen, Chiu-Ju Chen
  • Publication number: 20050055119
    Abstract: A method and system is provided for dynamically coordinating one or more product orders with product parts progressing through a manufacturing process flow. After identifying a first order for generating one or more lots of parts for manufacturing a first product, wherein the first order identifies a predetermined base feature, one or more customer specific features, one or more order specific features, and the quantity of the first product, A smart code is assigned to the first order and the lots of parts, wherein the smart code identifies an association between the first order and the lots of parts. An analysis is then performed, based on the smart codes assigned thereto, to see whether one or more available lots of parts of a second order in production are ready to be converted to produce the first product. The smart code of the available lots is changed to the smart code of the first order if the available lots of the second order are chosen to be further processed for fulfilling the first order.
    Type: Application
    Filed: September 5, 2003
    Publication date: March 10, 2005
    Inventors: Wei-Kuo Yen, Yi-Chin Hsu, Cheng-Che Chen, Chiu-Ju Chen
  • Publication number: 20040254825
    Abstract: An automated supply management system for dynamically fulfilling a customer requested order having an order fulfillment system for fulfilling a plurality of customer requests in accordance with a plurality of processing capacity restraints defined for a plurality of pieces of manufacturing equipment disposed within a manufacturing facility; an allocation planning system for receiving a plurality of capacity modeling data from the order fulfillment system, an order management system for communicating a plurality of consumption data and a customer requested due date to the order fulfillment system, wherein the order management system requests the customer requested due date and receives a calendar date of production available to promise from the order fulfillment system; and a manufacturing planning system for receiving an order fulfillment matrix from the order fulfillment system.
    Type: Application
    Filed: June 11, 2003
    Publication date: December 16, 2004
    Applicant: Taiwan Semiconductor Manufacturing Co., Ltd.
    Inventors: Chih-Yi Hsu, Yi-Chin Hsu, Y.C. Weng
  • Patent number: 6480794
    Abstract: To allocate products for machines on a manufacturing line, provide a standard test time. Minimize total test time with respect to production scheduling. Form a supply demand matrix table for products and machines for product allocation. Find the grid location with minimum testing time. Provide maximum time allocation from a machine at the corresponding position on the matrix table. Determine the grid location with the next minimum testing time. Loop back to provide a maximum allocation of remaining time from the corresponding machine and repeat looping back until no demand is left. Find need for an optimum testing process by testing whether only one machine can test the product and no quantity is allocated to a machine. If YES branch to calculate utilization per machine. If NO, decide whether NCOL+NLIN−1=NVB. If YES perform optimum testing. If NO, branch to calculate machine utilization per machine.
    Type: Grant
    Filed: August 1, 2000
    Date of Patent: November 12, 2002
    Assignee: Taiwan Semiconductor Manufacturing Company
    Inventors: Ming-Hsiu Hsieh, Fu-Kang Lai, Wen-Feng Wu, Yi-Hsin Chan, Yao-Tung Liu, Yi-Chin Hsu
  • Patent number: 5880960
    Abstract: The invention provides an index of line balance method for maintaining optimum queued quantities of products at a manufacturing step and over an entire manufacturing line. The method begins by: first, assigning a daily standard move of product (Std Move) which should be produced in a manufacturing line. Second, the standard WIP StdWIP is calculated for each manufacturing stage i by multiplying the theoretical cycle time C/T of each stage by the daily standard move StdMove; (i.e., StdWIP=CT*StdMove). Third, the difference Di between the current WIP CWi and standard WIP StdWIP at every stage i. (Di=Cwi-Swi, ) is calculated. Fourth, the cumulative difference CDi between current WIP Cwi and standard WIP StdWIP of every stage i from stage i to stage n is calculated. ##EQU1## Fifth, the index of line balance BIi is calculated by dividing the sum of all positive CDi from stage i to stage n by the absolute value of the sum of all negative CDi from stage i to stage n.
    Type: Grant
    Filed: January 27, 1997
    Date of Patent: March 9, 1999
    Assignee: Taiwan Semiconductor Manufacturing Company, Ltd.
    Inventors: Kuo-Chen Lin, Sheng-Rong Huang, Yi-Chin Hsu
  • Patent number: 5826238
    Abstract: A method and system are provided for operating a data processing system including a data base computer system and a resource allocation computer for control of resource allocation in a manufacturing plant with a manufacturing line comprising a plurality of stages with manufacturing machines, the resource allocation computer including data storage means. The method includes several steps including: deriving data from the data storage means and computing the targets for each of the stages; obtaining machine capacity data from the data storage means and employing the machine capacity data for allocating machine capacity proportionally and adjusting targets; adding limits to stages of penetration and adjusting targets; determining residual capacity and allocating the residual capacity of the manufacturing machines; and checking the convergence of targets and machine allocation until convergence is achieved.
    Type: Grant
    Filed: April 2, 1996
    Date of Patent: October 20, 1998
    Assignee: Taiwan Semiconductor Manufacturing
    Inventors: Wen-Lin Chen, Sheng-Rong Huang, Yi-Chin Hsu
  • Patent number: 5546326
    Abstract: This is a dynamic dispatching method for delivery performance by a factory. SLACK=(Due.sub.-- Date-Now)-(Forecast.sub.-- FAB.sub.-- Out.sub.-- Time); where Due.sub.-- Date=Scheduled due date from Master Production Schedule. The OTD (On Time Delivery) dynamic dispatching method focuses on the due date and the target cycle time under the environment of integrated circuit manufacturing. SLACK policy controls the long term due date and the OTD policy reflects the short term stage queue time. Through fuzzy theory, SLACK and OTD policies are combined as a dispatching controller to control the lot priority of the entire production line. The work piece, with either a long stage queue time, or with an urgent due date is pushed through the overall production line instead of jamming the front end of the process. A demand pull system satisfies the due date and the quantity of monthly demand.
    Type: Grant
    Filed: April 4, 1995
    Date of Patent: August 13, 1996
    Assignee: Taiwan Semiconductor Manufacturing Company Ltd
    Inventors: Wei-Heng Tai, Yi-Chin Hsu