-
21.发明授权Method for considering hierarchical preemptive demand priorities in a supply chain optimization model 失效在供应链优化模型中考虑层次化抢占需求优先级的方法公开(公告)号：US07966214B2
公开(公告)日：2011-06-21
申请号：US10707979
申请日：2004-01-29
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.
摘要翻译： 本发明包括一种在供应链优化模型中实现对抢占优先级的考虑的方法。 更具体地，本发明提供了一种在线性规划生产计划系统中将资源分配给需求优先级的层级的方法。 特别地，本发明将需求优先级集中到不同的优先级组中，并且使用第一线性规划模型将资源分配给最优先级的需求优先级组。 接下来，本发明使用第二线性规划模型将剩余资源分配给下一个最高优先级的需求优先级组。 第二个线性规划模型使用第一个线性规划模型的结果。 本发明通过重复地按照优先次序重复将剩余资源分配给剩余的需求优先级组的过程来继续该过程。 采用系统和方法将客户需求先发优先考虑的考虑与先进的规划系统结合起来，以优化既定的规划目标（例如客户服务，交货期短，库存量低，供应和容量的优先配置），以计算可行 生产计划部门。
-
公开(公告)号：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.
摘要翻译： 一种用于实现控制制造系统的方法的方法，系统和程序存储装置，其中所述方法包括在处理工具上提供待加工的多个工件，所述多个工件位于处理工具之前的处理站， 在工件到达处理工具之前，基于与多个工件相关联的特性来确定处理工具的辅助设备分配需求，以及基于在工件到达处理工具之前的分配需求将辅助设备发送到处理工具 。 根据本发明的实施例，处理工具包括光刻系统，辅助设备包括掩模版，并且多个工件包括半导体衬底。
-
公开(公告)号：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.
摘要翻译： 所公开的发明包括在创建生产计划时鼓励在多个客户之间公平共享有限材料库存和容量的方法。 本发明通过首先将需求分类为公平共享集合，在线性规划生产计划系统中的竞争需求中分配资源，其中每个集合内的所有需求具有相同的优先级，计算每个集合内的每个资源的累积需求，然后分配 资源按要求按照公平分配优先顺序排列。 如果在分配过程中，给定资源的供给不能满足给定集合的给定累积需求，则给定资源按比例（例如，均匀地或根据使用比例）在有助于给定累积需求的所有需求中分配 在给定的集合。 这是一个先进的规划系统，用于优化既定的规划目标（例如，客户服务，交货期短，库存低，供应和容量优先分配），以计算企业的可行生产计划。
-
24.发明授权Decomposition system and method for solving a large-scale semiconductor production planning problem 有权解决大规模半导体生产规划问题的分解制度和方法公开(公告)号：US06701201B2
公开(公告)日：2004-03-02
申请号：US09934662
申请日：2001-08-22
IPC分类号： G06F1760
CPC分类号： G06Q10/06 , G06Q10/0875 , Y02P90/86
摘要： A method and system for efficient allocation of limited manufacturing resources over time to meet customer demand. At the enterprise planning level this typically requires determination of a feasible production schedule for an extended supply chain. The method and system utilizes a new and unique type of systematic decomposition based on both product and process considerations. This approach simultaneously reduces the model size (and therefore computation time) and increases modeling flexibility from strictly linear programming based decision making to include more general nonlinear programming characteristics.
摘要翻译： 一种随时间有效分配有限制造资源以满足客户需求的方法和系统。 在企业规划层面，这通常需要确定扩展供应链的可行生产计划。 该方法和系统基于产品和过程考虑，利用新的和独特的系统分解类型。 这种方法同时降低了模型大小（并因此降低了计算时间），并且提高了基于严格线性规划的决策制定的建模灵活性，从而包括更一般的非线性规划特
-
25.发明授权Method to provide common support for multiple types of solvers for matching assets with demand in microelectronics manufacturing 失效为多种类型的求解器提供共同支持的方法，用于将资产与微电子制造的需求相匹配
公开(公告)号：US6041267A
公开(公告)日：2000-03-21
申请号：US938753
申请日：1997-09-26
IPC分类号： G05B19/418 , G06F19/00
CPC分类号： G05B19/41865 , Y02P90/20
摘要： A computer implemented decision support tool serves as a vehicle to enable a user to execute within a common work environment, from common production information files, and at the discretion of the user one of three types of matching between existing assets and demands across multiple manufacturing facilities within boundaries established by manufacturing specifications and process flows and business policies. The tool provides an environment which permits the user to easily gain the advantages of a synergistic relationship between the three types of matching. The tool directly supports three types of matching: (1) material requirements planning (MRP) type of matching, (2) best can do (BCD) type of matching, and (3) projected supply planning (PSP) type of matching.
摘要翻译： 计算机实施的决策支持工具可用作车辆，以使用户能够在共同的工作环境中从共同的生产信息文件执行，并且由用户自行决定现有资产与多个制造设备之间的需求之间的三种类型的匹配之一 在制造规范和流程流程和业务政策建立的边界内。 该工具提供了允许用户容易地获得三种匹配之间协同关系的优点的环境。 该工具直接支持三种类型的匹配：（1）物料需求计划（MRP）匹配类型，（2）最佳可做（BCD）类型的匹配，以及（3）预计供应计划（PSP）类型的匹配。
-
公开(公告)号：US20110199114A1
公开(公告)日：2011-08-18
申请号：US12706228
申请日：2010-02-16
IPC分类号： G01R31/26
CPC分类号： G01R31/31703 , G01R31/31935
摘要： A method, system, and program product for identifying at least one bit failure among a plurality of semiconductor chips are provided. A first aspect of the invention provides a method of identifying at least one bit failure signature among a plurality of semiconductor chips, the method comprising: counting failures of each failing bit among the plurality of semiconductor chips; determining a most commonly failing bit (MCFB) among the failing bits; establishing a bit failure signature including the MCFB; counting failures of each failing bit on semiconductor chips on which the MCFB fails; determining a next most commonly failing bit (NMCFB) among the failing bits on semiconductor chips on which the MCFB fails; determining whether the NMCFB tends to fail when the MCFB fails; and in response to a determination that the NMCFB tends to fail when the MCFB fails, adding the NMCFB to the bit failure signature.
摘要翻译： 提供了用于识别多个半导体芯片中的至少一个位故障的方法，系统和程序产品。 本发明的第一方面提供了一种识别多个半导体芯片中的至少一个位故障签名的方法，所述方法包括：对所述多个半导体芯片中的每个故障位进行计数故障; 确定故障位中最常见的故障位（MCFB）; 建立包括MCFB在内的位故障签名; 在MCFB故障的半导体芯片上的每个故障位的计数失败; 确定在MCFB故障的半导体芯片上的故障位中的下一个最常故障位（NMCFB）; 确定当MCFB发生故障时，NMCFB是否会失败; 并且响应于当MCFB失败时NMCFB趋向于失败的确定，将NMCFB添加到位故障签名。
-
27.发明授权Method for simultaneously considering customer support dates and customer request dates 失效同时考虑客户支持日期和客户要求日期的方法公开(公告)号：US07778860B2
公开(公告)日：2010-08-17
申请号：US12434733
申请日：2009-05-04
申请人： 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.
摘要翻译： 这里公开的发明是在高级规划系统内同时考虑多个客户需求日期的方法。 本发明提供了考虑多个到期日的生产计划的方法。 本发明基于第二（提交）日期来解决生产计划模型以产生第一解决方案，按照重要性的顺序对需求记录进行排序，然后基于第一（请求）日期重新解决生产计划模型，以产生 第二个解决方案。 重新解决过程按照重要性的排序顺序对每个需求项进行。 本发明优化了第一溶液和第二溶液。 在重新解决生产计划模型之前，本发明改变了对逆序变量的下限约束。 重新解决过程更改单个需求项目的所需日期，并且对于在相应的所需日期之前的第一个（请求）日期的所有需求项目重复该重新解决过程。 本发明报告了在优化过程中产生的最佳解决方案。 系统和方法将多个需求日期的考虑与先进的计划制度结合起来，以优化既定的规划目标（例如客户服务，交货期短，库存低，供应和能力优先配置），以计算可行的生产计划 。
-
公开(公告)号：US07653451B2
公开(公告)日：2010-01-26
申请号：US12023104
申请日：2008-01-31
IPC分类号： G09F19/00
CPC分类号： G05B19/41865 , G05B2219/31411 , G05B2219/32247 , G05B2219/32267 , G05B2219/32271 , G05B2219/32293 , G05B2219/45028 , Y02P90/20
摘要： Disclosed is a method of controlling a manufacturing system. The invention automatically monitors current levels of partially completed products waiting to be processed by a tool (or group of tools) and determines whether the current levels exceed a predetermined limit. If the current levels do exceed the predetermined limit, the invention performs an optimization process. However, if the current levels do not exceed the predetermined limit, the invention performs a dispatching process. In this dispatching process, the invention automatically projects future levels of partially completed products that will be supplied to the tool to identify a future work-in-process (WIP) bubble. The WIP bubble occurs when larger than normal amounts of partially completed products are supplied to the tool. The invention automatically adjusts the operating parameters of the tool based upon both the current levels and the future levels.
摘要翻译： 公开了一种控制制造系统的方法。 本发明自动监视等待由工具（或一组工具）处理的部分完成的产品的当前水平，并确定当前水平是否超过预定极限。 如果当前水平超过预定极限，本发明进行优化处理。 然而，如果当前电平不超过预定限度，则本发明执行调度处理。 在这个调度过程中，本发明会自动将未来的部分完成产品的水平提供给工具，以识别未来的在制品（WIP）泡沫。 当大于正常量的部分完成的产品被提供给工具时，会出现WIP气泡。 本发明基于当前水平和未来水平自动调整工具的操作参数。
-
公开(公告)号：US07590461B2
公开(公告)日：2009-09-15
申请号：US11278817
申请日：2006-04-06
申请人： Robert J. Milne , Robert A. Orzell , Chi-Tai Wang
发明人： Robert J. Milne , Robert A. Orzell , Chi-Tai Wang
CPC分类号： G06Q10/06 , G06Q10/087
摘要： 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.
摘要翻译： 生产计划方法输入对产品的需求。 需求有多个到期日，多个到期日期有不同的优先顺序。 该方法使用线性规划和启发式方法来执行爆炸过程，以识别用于制造产品的组件的需求（爆炸过程保持组件的多个到期日期和相应的优先级），并使用线性规划和启发式进行内爆过程 考虑多个到期日期和相应的优先级，为组件分配资源。
-
公开(公告)号：US20090228128A1
公开(公告)日：2009-09-10
申请号：US12468249
申请日：2009-05-19
申请人： Robert J. Milne , Robert A. Orzell , Chi-Tai Wang
发明人： Robert J. Milne , Robert A. Orzell , Chi-Tai Wang
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06Q10/087
摘要： 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.
摘要翻译： 生产计划方法输入对产品的需求。 需求有多个到期日，多个到期日期有不同的优先顺序。 该方法使用线性规划和启发式方法来执行爆炸过程，以识别用于制造产品的组件的需求（爆炸过程保持组件的多个到期日期和相应的优先级），并使用线性规划和启发式进行内爆过程 考虑多个到期日期和相应的优先级，为组件分配资源。
-
-
-
-
-
-
-
-
-
搜索结果
46 条记录 (耗时 0.031 秒)
