Patents by Inventor Chi-Tai Wang
Chi-Tai Wang 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: 8140372Abstract: Method, system and program product for planning production for complementary demands are disclosed. In one embodiment, a method includes obtaining complementary demand values including at least one daily going rate (DGR) demand and a service demand; running a first planning production model in which the at least one DGR demand is included and the service demand is excluded; and running a second planning production model in which DGR related variables are fixed to values determined in the first planning production model and the service demand is included. Demands that are only considered by one of the planning production models are considered complementary demands.Type: GrantFiled: August 3, 2006Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Chih-Hui Chang, Brian T. Denton, Sanjay R. Hegde, Robert J. Milne, Stuart H. Smith, Chi-Tai Wang, Jacqueline N. Ward
-
Patent number: 7937475Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.Type: GrantFiled: May 22, 2008Date of Patent: May 3, 2011Assignee: International Business Machines CorporationInventors: Brian T. Denton, Robert J. Milne, Chi-Tai Wang
-
Patent number: 7856287Abstract: A production planning technique inputs demands for products. Each of the demands having multiple due dates, and the multiple due dates having different priorities. An explosion process utilizing linear programming and heuristics is performed to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.Type: GrantFiled: May 19, 2009Date of Patent: December 21, 2010Assignee: International Business Machines CorporationInventors: Robert J. Milne, Robert A. Orzell, Chi-Tai Wang
-
Patent number: 7606743Abstract: A method, a system for practicing the method and a storage device storing the method for identifying product assets in a supply chain used to satisfy customer demands. The method including: receiving a feasible schedule of all components to be assembled into products; receiving customer schedules for delivery of the products; and generating from the feasible schedule, from the customer schedules and from bills of materials listing all components required for a particular product, a set of demand pegging records, the demand pegging records associating a quantity and an availability date of each component of each product with a required quantity of each of the products, each demand pegging record consistent with the feasible schedule.Type: GrantFiled: February 10, 2004Date of Patent: October 20, 2009Assignee: International Business Machines CorporationInventors: Robert A. Orzell, Shivakumar P. Patil, Chi-Tai Wang
-
Patent number: 7590461Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.Type: GrantFiled: April 6, 2006Date of Patent: September 15, 2009Assignee: International Business Machines CorporationInventors: Robert J. Milne, Robert A. Orzell, Chi-Tai Wang
-
Publication number: 20090228128Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.Type: ApplicationFiled: May 19, 2009Publication date: September 10, 2009Applicant: International Business Machines CorporationInventors: Robert J. Milne, Robert A. Orzell, Chi-Tai Wang
-
Publication number: 20080221962Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.Type: ApplicationFiled: May 22, 2008Publication date: September 11, 2008Applicant: International Business Machines CorporationInventors: Brian T. Denton, Robert J. Milne, Chi-Tai Wang
-
Patent number: 7383337Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan. the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.Type: GrantFiled: January 29, 2004Date of Patent: June 3, 2008Assignee: International Business Machines CorporationInventors: Brian T. Denton, Robert J. Milne, Chi-Tai Wang
-
Publication number: 20080033586Abstract: Method, system and program product for planning production for complementary demands are disclosed. In one embodiment, a method includes obtaining complementary demand values including at least one daily going rate (DGR) demand and a service demand; running a first planning production model in which the at least one DGR demand is included and the service demand is excluded; and running a second planning production model in which DGR related variables are fixed to values determined in the first planning production model and the service demand is included. Demands that are only considered by one of the planning production models are considered complementary demands.Type: ApplicationFiled: August 3, 2006Publication date: February 7, 2008Inventors: Chih-Hui Chang, Brian T. Denton, Sanjay R. Hegde, Robert J. Milne, Stuart H. Smith, Chi-Tai Wang, Jacqueline N. Ward
-
Publication number: 20070239299Abstract: A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.Type: ApplicationFiled: April 6, 2006Publication date: October 11, 2007Inventors: Robert Milne, Robert Orzell, Chi-Tai Wang
-
Publication number: 20050177465Abstract: A method, a system for practicing the method and a storage device storing the method for identifying product assets in a supply chain used to satisfy customer demands. The method including: receiving a feasible schedule of all components to be assembled into products; receiving customer schedules for delivery of the products; and generating from the feasible schedule, from the customer schedules and from bills of materials listing all components required for a particular product, a set of demand pegging records, the demand pegging records associating a quantity and an availability date of each component of each product with a required quantity of each of the products, each demand pegging record consistent with the feasible schedule.Type: ApplicationFiled: February 10, 2004Publication date: August 11, 2005Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert Orzell, Shivakumar Patil, Chi-Tai Wang
-
Publication number: 20050171786Abstract: The invention disclosed comprises a method for encouraging fair sharing of limited material inventory and capacity between multiple customers when creating a production plan. the invention allocates resources among competing demands in a linear programming production planning system by first classifying the demands into fair share sets, wherein all demands within each set have the same priority, calculating the cumulative demand for each resource within each set, and then allocating the resources to the demands in order of fair share set priority. If, during the allocating process, the supply of a given resource cannot satisfy a given cumulative demand of a given set, the given resource is allocated proportionally (e.g., evenly or according to usage proportions) among all demands that contribute to the given cumulative demand within the given set. This is an advanced planning system for optimizing established planning objectives (e.g.Type: ApplicationFiled: January 29, 2004Publication date: August 4, 2005Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Brian Denton, Robert Milne, Chi-Tai Wang