专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07738984B2 System for and method of interpolation for supply chain planning 失效
标题翻译：供应链计划插值系统和插值方法
公开(公告)号：US07738984B2
公开(公告)日：2010-06-15
申请号：US11530999
申请日：2006-09-12
申请人： Brian T. Denton , Thomas R. Ervolina , Robert J. Milne , Robert A. Orzell , Samik Raychaudhuri
发明人： Brian T. Denton , Thomas R. Ervolina , Robert J. Milne , Robert A. Orzell , Samik Raychaudhuri
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06Q10/063
摘要： A method of iterative negotiation for improved production planning between one or more purchasers and suppliers in a supply chain. The method includes a purchaser in a supply chain generating a request schedule that is communicated to a supplier. In response to the request schedule the supplier generates a commit schedule and communicates it back to the purchaser. Through the iterative negotiation process (ask-answer) one or more interpolation constraints are generated based on the supplier's commit schedules. Upon completion of the ask-answer process purchaser solves a final advanced planning system (APS) based on said one or more interpolation constraints and generates a final production plan. The invention can be employed to integrate the collaboration among purchasers and suppliers with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity).
摘要翻译：一种迭代谈判的方法，用于改善供应链中一个或多个购买者和供应商之间的生产计划。该方法包括在供应链中的购买者，生成与供应商通信的请求时间表。响应于请求时间表，供应商生成提交计划并将其传送给购买者。通过迭代协商过程（询问答案），基于供应商的提交时间表生成一个或多个内插约束。在询问过程完成后，购买者根据所述一个或多个内插约束来解决最终的高级计划系统（APS），并且生成最终生产计划。本发明可用于将购买者和供应商之间的协作整合到用于优化既定规划目标（例如客户服务，短交货期，低库存以及供应和容量的优先分配）的高级规划系统。

2. 发明申请

US20080071603A1 SYSTEM FOR AND METHOD OF INTERPOLATION FOR SUPPLY CHAIN PLANNING 失效
标题翻译：用于供应链规划的插入系统和插值方法
公开(公告)号：US20080071603A1
公开(公告)日：2008-03-20
申请号：US11530999
申请日：2006-09-12
申请人： Brian T. Denton , Thomas R. Ervolina , Robert J. Milne , Robert A. Orzell , Samik Raychaudhuri
发明人： Brian T. Denton , Thomas R. Ervolina , Robert J. Milne , Robert A. Orzell , Samik Raychaudhuri
IPC分类号： G06F15/02 , G07G1/00 , G06F9/44
CPC分类号： G06Q10/06 , G06Q10/063
摘要： A method of iterative negotiation for improved production planning between one or more purchasers and suppliers in a supply chain. The method includes a purchaser in a supply chain generating a request schedule that is communicated to a supplier. In response to the request schedule the supplier generates a commit schedule and communicates it back to the purchaser. Through the iterative negotiation process (ask-answer) one or more interpolation constraints are generated based on the supplier's commit schedules. Upon completion of the ask-answer process purchaser solves a final advanced planning system (APS) based on said one or more interpolation constraints and generates a final production plan. The invention can be employed to integrate the collaboration among purchasers and suppliers with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity).
摘要翻译：一种迭代谈判的方法，用于改善供应链中一个或多个购买者和供应商之间的生产计划。该方法包括在供应链中的购买者，生成与供应商通信的请求时间表。响应于请求时间表，供应商生成提交计划并将其传送给购买者。通过迭代协商过程（询问答案），基于供应商的提交时间表生成一个或多个内插约束。在询问过程完成后，购买者根据所述一个或多个内插约束来解决最终的高级计划系统（APS），并且生成最终生产计划。本发明可用于将购买者和供应商之间的协作整合到用于优化既定规划目标（例如客户服务，短交货期，低库存以及供应和容量的优先分配）的高级规划系统。

3. 发明授权

US07966208B2 Method for purchase order rescheduling in a linear program 失效
标题翻译：在线性程序中重新安排采购订单的方法
公开(公告)号：US07966208B2
公开(公告)日：2011-06-21
申请号：US10707974
申请日：2004-01-29
申请人： Brian T. Denton , Robert J. Milne , Robert A. Orzell
发明人： Brian T. Denton , Robert J. Milne , Robert A. Orzell
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06 , G06Q10/0631 , G06Q10/06312 , G06Q10/06314 , G06Q10/06315 , G06Q30/06
摘要： The invention provides a method of rescheduling timing of when items on purchase orders are scheduled to be received in a linear programming production planning system. This methodology performs a pre-processing rescheduling of the timing of purchase order receipts into the earliest time period allowable in a pre-processing step. After this pre-processing, the invention solves the core production planning system equations using the rescheduled purchase order receipts. Then, the invention performs post-processing rescheduling, which sorts the purchase order receipts according to rescheduling flexibility, and subsequently sequentially reschedules the timing of each of the purchase order receipts in the order established by the sorting process. This process of sequentially rescheduling reschedules the timing of purchase order receipts into the latest time period allowable.
摘要翻译：本发明提供了一种重新安排在线性规划生产计划系统中调度在采购订单上的物品被接收的时间的方法。该方法对购买订单收据的定时进行预处理重新安排到预处理步骤中允许的最早时间段。在这种预处理之后，本发明使用重新安排的采购订单收据来解决核心生产计划系统方程式。然后，本发明执行后处理重新安排，其根据重新安排的灵活性对采购订单收据进行排序，然后按照分类处理建立的顺序顺序重新安排每个采购单收货的定时。该顺序重新安排的过程将购买订单收据的时间安排到允许的最新时间段内。

4. 发明授权

US07103436B2 Method for optimizing foundry capacity 失效
标题翻译：优化铸造能力的方法
公开(公告)号：US07103436B2
公开(公告)日：2006-09-05
申请号：US10707976
申请日：2004-01-29
申请人： Brian T. Denton , Robert J. Milne , Robert A. Orzell , Satyadeep Vajjala , Jacqueline N. Ward
发明人： Brian T. Denton , Robert J. Milne , Robert A. Orzell , Satyadeep Vajjala , Jacqueline N. Ward
IPC分类号： G06F19/00
CPC分类号： G06Q10/00 , G06Q10/04 , G06Q30/00
摘要： The invention provides a method and system for determining a production plan that includes a first step that determines the minimum number of manufacturing starts that are required to meet contractual obligations; and a second step which determines a production plan satisfying the minimum manufacturing starts together with other customer demands. More specifically, the invention presents a method of allocating production starts (e.g., wafer starts) in a manufacturing facility (e.g., wafer foundry) using a linear programming production planning system which performs a first stage of linear programming to satisfy only contractually mandated minimum production starts constraints followed by a second stage of linear programming to satisfy the additional constraints, once the minimum starts constraints are satisfied.
摘要翻译：本发明提供了一种用于确定生产计划的方法和系统，其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。更具体地，本发明提出了一种使用线性规划生产计划系统在制造设施（例如，晶圆代工厂）中分配生产开始（例如，晶片启动）的方法，线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产一旦满足最小启动约束，则开始约束，随后是线性规划的第二阶段以满足附加约束。

5. 发明授权

US06584370B2 Method of calculating low level codes for considering capacities 有权
公开(公告)号：US06584370B2
公开(公告)日：2003-06-24
申请号：US09891554
申请日：2001-06-26
申请人： Brian T. Denton , Sanjay R. Hegde , Robert A. Orzell
发明人： Brian T. Denton , Sanjay R. Hegde , Robert A. Orzell
IPC分类号： G06F1524
CPC分类号： G06Q10/0875 , G06Q10/087
摘要： A method and system for controlling sequential capacity allocation through modification of traditional low level codes (LLC). The method and system of the present invention employs a systematic set of decision rules for interactively adjusting LLCs so that they are consistent with interdependencies of resources among parts due to resource sharing.

6. 发明授权

US07584113B2 Method for simultaneously considering customer commit dates and customer request dates 失效
标题翻译：同时考虑客户提交日期和客户要求日期的方法
公开(公告)号：US07584113B2
公开(公告)日：2009-09-01
申请号：US10707973
申请日：2004-01-29
申请人： Brian T. Denton , Robert J. Milne
发明人： Brian T. Denton , Robert J. Milne
IPC分类号： G05B19/418
CPC分类号： G06Q10/06 , G06Q10/06312 , G06Q10/06314 , G06Q10/06315 , G06Q10/067 , G06Q10/103 , G06Q30/0202 , Y02P90/20
摘要： The invention disclosed here is a method for achieving simultaneous consideration of multiple customer demand dates within an advanced planning system. The invention provides a method of production planning that considers multiple due dates. The invention solves a production planning model based upon the second (commit) date to produce a first solution, sorts the demand records in order of importance, and then re-solves the production planning model based upon the first (request) date to produce a second solution. The re-solving process is performed on each demand item in the sorted order of importance. The invention optimizes between the first solution and the second solution. Before re-solving the production planning model, the invention changes the lower bound constraints on backorder variables. The re-solving process changes the required date for a single demand item, and this re-solving process is repeated for all demand items that have a first (request) date that is before a corresponding required date. The invention reports the optimal solution produced during the optimizing process. The system and method integrate the consideration of multiple demand dates with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the division.
摘要翻译：这里公开的发明是在高级规划系统内同时考虑多个客户需求日期的方法。本发明提供了考虑多个到期日的生产计划的方法。本发明基于第二（提交）日期来解决生产计划模型以产生第一解决方案，按照重要性的顺序对需求记录进行排序，然后基于第一（请求）日期重新解决生产计划模型，以产生第二个解决方案。重新解决过程按照重要性的排序顺序对每个需求项进行。本发明优化了第一溶液和第二溶液。在重新解决生产计划模型之前，本发明改变了对逆序变量的下限约束。重新解决过程更改单个需求项目的所需日期，并且对于在相应的所需日期之前的第一个（请求）日期的所有需求项目重复该重新解决过程。本发明报告了在优化过程中产生的最佳解决方案。系统和方法将多个需求日期的考虑与先进的计划制度结合起来，以优化既定的规划目标（例如客户服务，交货期短，库存低，供应和能力优先配置），以计算可行的生产计划。

7. 发明授权

US07966214B2 Method for considering hierarchical preemptive demand priorities in a supply chain optimization model 失效
标题翻译：在供应链优化模型中考虑层次化抢占需求优先级的方法
公开(公告)号：US07966214B2
公开(公告)日：2011-06-21
申请号：US10707979
申请日：2004-01-29
申请人： Brian T. Denton , John J. Forrest , Robert J. Milne
发明人： Brian T. Denton , John J. Forrest , Robert J. Milne
IPC分类号： G06F9/46
CPC分类号： G06Q10/087 , G06Q10/0631 , G06Q10/06312 , G06Q10/06314 , G06Q10/06315 , G06Q10/06375
摘要： The invention comprises a method for achieving consideration of preemptive priorities within a supply chain optimization model. More specifically, the invention provides a method of allocating resources to a hierarchy of demand priorities in a linear programming production planning system. In particular, the invention aggregates the demand priorities into different priority groups and allocates the resources to the highest priority group of demand priorities using a first linear programming model. Next, the invention allocates remaining resources to the next highest priority group of demand priorities using a second linear programming model. The second linear programming model uses results from the first linear programming model. The invention continues this process by iteratively repeating the process of allocating remaining resources to the remaining groups of demand priorities, in order of priority. The system and method were employed to integrate the consideration of preemptive prioritization of customer demands with an advanced planning system for optimizing established planning objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the division.
摘要翻译：本发明包括一种在供应链优化模型中实现对抢占优先级的考虑的方法。更具体地，本发明提供了一种在线性规划生产计划系统中将资源分配给需求优先级的层级的方法。特别地，本发明将需求优先级集中到不同的优先级组中，并且使用第一线性规划模型将资源分配给最优先级的需求优先级组。接下来，本发明使用第二线性规划模型将剩余资源分配给下一个最高优先级的需求优先级组。第二个线性规划模型使用第一个线性规划模型的结果。本发明通过重复地按照优先次序重复将剩余资源分配给剩余的需求优先级组的过程来继续该过程。采用系统和方法将客户需求先发优先考虑的考虑与先进的规划系统结合起来，以优化既定的规划目标（例如客户服务，交货期短，库存量低，供应和容量的优先配置），以计算可行生产计划部门。

8. 发明授权

US07953507B2 Method and system for intelligent automated reticle managment 有权
标题翻译：智能自动光罩管理方法与系统
公开(公告)号：US07953507B2
公开(公告)日：2011-05-31
申请号：US11669179
申请日：2007-01-31
申请人： Richard G. Burda , Alfred Degbotse , Brian T. Denton , Kenneth J. Fordyce , Sanjay Hegde , Robert J. Milne , Sameer T. Shikalgar , Guogang Zuo
发明人： Richard G. Burda , Alfred Degbotse , Brian T. Denton , Kenneth J. Fordyce , Sanjay Hegde , Robert J. Milne , Sameer T. Shikalgar , Guogang Zuo
IPC分类号： G06F19/00
CPC分类号： G03F7/70741
摘要： A method, system, and program storage device for implementing the method of controlling a manufacturing system, wherein the method comprises providing a plurality of workpieces to be processed on a processing tool, the plurality of workpieces located at processing stations prior to the processing tool, determining auxiliary equipment allocation needs for the processing tool based on characteristics associated with the plurality of workpieces prior to the workpieces arriving at the processing tool, and sending auxiliary equipment to the processing tool based on the allocation needs prior to the workpieces arriving at the processing tool. According to an embodiment of the invention, the processing tool comprises a photolithographic system, the auxiliary equipment comprises a reticle, and the plurality of workpieces comprise semiconductor substrates.
摘要翻译：一种用于实现控制制造系统的方法的方法，系统和程序存储装置，其中所述方法包括在处理工具上提供待加工的多个工件，所述多个工件位于处理工具之前的处理站，在工件到达处理工具之前，基于与多个工件相关联的特性来确定处理工具的辅助设备分配需求，以及基于在工件到达处理工具之前的分配需求将辅助设备发送到处理工具。根据本发明的实施例，处理工具包括光刻系统，辅助设备包括掩模版，并且多个工件包括半导体衬底。

9. 发明授权

US07383337B2 Method for fair sharing limited resources between multiple customers 失效
标题翻译：公平分享多个客户资源有限的方法
公开(公告)号：US07383337B2
公开(公告)日：2008-06-03
申请号：US10707972
申请日：2004-01-29
申请人： Brian T. Denton , Robert J. Milne , Chi-Tai Wang
发明人： Brian T. Denton , Robert J. Milne , Chi-Tai Wang
IPC分类号： G06F15/173
CPC分类号： G06Q10/06 , G06Q10/06315
摘要： 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., customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) to compute a feasible production plan for the enterprise.
摘要翻译：所公开的发明包括在创建生产计划时鼓励在多个客户之间公平共享有限材料库存和容量的方法。本发明通过首先将需求分类为公平共享集合，在线性规划生产计划系统中的竞争需求中分配资源，其中每个集合内的所有需求具有相同的优先级，计算每个集合内的每个资源的累积需求，然后分配资源按要求按照公平分配优先顺序排列。如果在分配过程中，给定资源的供给不能满足给定集合的给定累积需求，则给定资源按比例（例如，均匀地或根据使用比例）在有助于给定累积需求的所有需求中分配在给定的集合。这是一个先进的规划系统，用于优化既定的规划目标（例如，客户服务，交货期短，库存低，供应和容量优先分配），以计算企业的可行生产计划。

10. 发明申请

US20080033586A1 PLANNING PRODUCTION FOR COMPLEMENTARY DEMANDS 失效
标题翻译：相关计划的规划生产
公开(公告)号：US20080033586A1
公开(公告)日：2008-02-07
申请号：US11462111
申请日：2006-08-03
申请人： Chih-Hui Chang , Brian T. Denton , Sanjay R. Hegde , Robert J. Milne , Stuart H. Smith , Chi-Tai Wang , Jacqueline N. Ward
发明人： Chih-Hui Chang , Brian T. Denton , Sanjay R. Hegde , Robert J. Milne , Stuart H. Smith , Chi-Tai Wang , Jacqueline N. Ward
IPC分类号： G06F19/00
CPC分类号： G06Q10/087 , G06Q10/06315
摘要： 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.
摘要翻译：披露了用于规划生产补充需求的方法，系统和程序产品。在一个实施例中，一种方法包括获得包括至少一个日常运行速率（DGR）需求和服务需求的补充需求值; 运行首个规划生产模式，其中包括至少一个DGR需求并排除服务需求; 并运行第二个规划生产模型，其中DGR相关变量固定为在第一个规划生产模型中确定的值和服务需求。仅由规划生产模式之一考虑的要求被认为是补充需求。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式