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

11. 发明申请

US20110307087A1 SYSTEMS AND METHODS OF RESCHEDULING MANUFACTURING RELEASES 失效
标题翻译：制冷剂制备系统和方法
公开(公告)号：US20110307087A1
公开(公告)日：2011-12-15
申请号：US12796716
申请日：2010-06-09
申请人： Alfred T. Degbotse , Robert J. Milne , Stuart H. Smith , Jacqueline N. Ward
发明人： Alfred T. Degbotse , Robert J. Milne , Stuart H. Smith , Jacqueline N. Ward
IPC分类号： G05B13/02
CPC分类号： G05B19/41865 , G05B2219/32256 , Y02P90/20
摘要： Techniques are presented for rescheduling manufacturing releases. A plurality of release information elements are identified based on a first run of a first advanced planning system. The release information elements comprise dates of planned manufacturing release and quantity. The plurality of release information elements are sorted based on associated demand-likelihood factors and a plurality of sorting criteria. Swapping candidates are selected and swaps are performed based on the demand-likelihood factors and at least one swapping constraint. The plurality of release information elements are then fixed and output as results. A second run of an advanced planning system is optionally performed before output and may include stability features.
摘要翻译：介绍了重新安排制造版本的技术。基于第一高级计划系统的第一次运行来识别多个释放信息元素。发布信息元素包括计划制造发布和数量的日期。基于相关联的需求似然因子和多个排序标准对多个释放信息元素进行排序。选择交换候选者并基于需求似然因子和至少一个交换约束执行交换。然后，多个释放信息元素被固定并作为结果输出。可选地，在输出之前执行高级计划系统的第二次运行，并且可以包括稳定性特征。

12. 发明授权

US07734365B2 Supply consumption optimization and multiple component utilization 失效
标题翻译：供应消耗优化和多部件利用
公开(公告)号：US07734365B2
公开(公告)日：2010-06-08
申请号：US12468203
申请日：2009-05-19
申请人： Alfred T. Degbotse , Robert J. Milne , Robert A. Orzell
发明人： Alfred T. Degbotse , Robert J. Milne , Robert A. Orzell
IPC分类号： G06F19/00
CPC分类号： G06Q10/04 , G06Q10/087
摘要： The invention disclosed here is a method for achieving simultaneous consideration of multiple independent dates associated with a single demand. The method iterates through the demands to match the demands with the supply quantities respecting demand priorities which vary over time and demand quantities which may perish over time. One embodiment of the invention allocates demand to supply through an iterative process beginning with earlier demand requirement dates and concluding with later demands which may preempt supply from earlier demands depending upon their relative priorities. An additional embodiment transforms the demands to create multiple demand records, each having an associated priority, such that a single original demand record is transformed into a plurality of related demand records, each having an associated priority. The component supply quantities are accumulated into period ending inventories. The method matches the multiple demand records (in priority sequence) to the period ending inventories.
摘要翻译：这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。该方法迭代了需求，以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求，并且以随后的需求结束，这些需求可以根据其相对优先级抢先提供更多需求。另外的实施例转换需求以创建多个需求记录，每个需求记录具有相关联的优先级，使得单个原始需求记录被转换成多个相关需求记录，每个相关需求记录具有相关联的优先级。部件供应量累计到期末存货。该方法将多个需求记录（优先顺序）与结束库存期间相匹配。

13. 发明授权

US07590463B2 Supply consumption optimization and multiple component utilization 失效
标题翻译：供应消耗优化和多部件利用
公开(公告)号：US07590463B2
公开(公告)日：2009-09-15
申请号：US11278819
申请日：2006-04-06
申请人： Alfred T. Degbotse , Robert J. Milne , Robert A. Orzell
发明人： Alfred T. Degbotse , Robert J. Milne , Robert A. Orzell
IPC分类号： G06F19/00
CPC分类号： G06Q10/04 , G06Q10/087
摘要： The invention disclosed here is a method for achieving simultaneous consideration of multiple independent dates associated with a single demand. The method iterates through the demands to match the demands with the supply quantities respecting demand priorities which vary over time and demand quantities which may perish over time. One embodiment of the invention allocates demand to supply through an iterative process beginning with earlier demand requirement dates and concluding with later demands which may preempt supply from earlier demands depending upon their relative priorities. An additional embodiment transforms the demands to create multiple demand records, each having an associated priority, such that a single original demand record is transformed into a plurality of related demand records, each having an associated priority. The component supply quantities are accumulated into period ending inventories. The method matches the multiple demand records (in priority sequence) to the period ending inventories.
摘要翻译：这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。该方法迭代了需求，以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求，并且以随后的需求结束，这些需求可以根据其相对优先级抢先提供更多需求。另外的实施例转换需求以创建多个需求记录，每个需求记录具有相关联的优先级，使得单个原始需求记录被转换成多个相关需求记录，每个相关需求记录具有相关联的优先级。部件供应量累计到期末存货。该方法将多个需求记录（优先顺序）与结束库存期间相匹配。

14. 发明授权

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.
摘要翻译：本发明提供了一种重新安排在线性规划生产计划系统中调度在采购订单上的物品被接收的时间的方法。该方法对购买订单收据的定时进行预处理重新安排到预处理步骤中允许的最早时间段。在这种预处理之后，本发明使用重新安排的采购订单收据来解决核心生产计划系统方程式。然后，本发明执行后处理重新安排，其根据重新安排的灵活性对采购订单收据进行排序，然后按照分类处理建立的顺序顺序重新安排每个采购单收货的定时。该顺序重新安排的过程将购买订单收据的时间安排到允许的最新时间段内。

15. 发明授权

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.
摘要翻译：这里公开的发明是在高级规划系统内同时考虑多个客户需求日期的方法。本发明提供了考虑多个到期日的生产计划的方法。本发明基于第二（提交）日期来解决生产计划模型以产生第一解决方案，按照重要性的顺序对需求记录进行排序，然后基于第一（请求）日期重新解决生产计划模型，以产生第二个解决方案。重新解决过程按照重要性的排序顺序对每个需求项进行。本发明优化了第一溶液和第二溶液。在重新解决生产计划模型之前，本发明改变了对逆序变量的下限约束。重新解决过程更改单个需求项目的所需日期，并且对于在相应的所需日期之前的第一个（请求）日期的所有需求项目重复该重新解决过程。本发明报告了在优化过程中产生的最佳解决方案。系统和方法将多个需求日期的考虑与先进的计划制度结合起来，以优化既定的规划目标（例如客户服务，交货期短，库存低，供应和能力优先配置），以计算可行的生产计划。

16. 发明授权

US08185420B2 Approximating cycle times within material flow network 失效
标题翻译：材料流网络中的近似周期时间
公开(公告)号：US08185420B2
公开(公告)日：2012-05-22
申请号：US12038134
申请日：2008-02-27
申请人： Alfred Degbotse , Brian T. Denton , Robert J. Milne
发明人： Alfred Degbotse , Brian T. Denton , Robert J. Milne
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06 , G06Q10/06312 , G06Q10/0633 , G06Q10/0875 , G06Q50/06
摘要： Approximating cycle times within a material flow network is disclosed. One embodiment includes assigning an approximate cycle time for completion of a part number PN within the material flow network by using a model that rounds the approximate cycle time to a nearest aggregate time period and adjusting the assigned approximate cycle time based on a mathematical function representing an aggregate accuracy of an aggregation of cycle times throughout the material flow network.
摘要翻译：公开了材料流网络内的近似循环时间。一个实施例包括通过使用将近似周期时间舍入到最近聚合时间周期的模型来分配在材料流网络内完成零件号PN的近似周期时间，并且基于表示一个数学函数的数学函数来调整所分配的近似周期时间整个材料流网络周期时间聚合的聚合精度。

17. 发明授权

US07937475B2 Method for fair sharing limited resources between multiple customers 失效
标题翻译：公平分享多个客户资源有限的方法
公开(公告)号：US07937475B2
公开(公告)日：2011-05-03
申请号：US12125193
申请日：2008-05-22
申请人： 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.
摘要翻译：所公开的发明包括一种在线性规划生产计划系统中通过首先将需求分类为公平共享集合来创建生产计划时，鼓励在多个客户之间公平共享有限物料库存和容量的方法，该方法通过在线性规划生产计划系统中的竞争需求中分配资源，其中所有每个集合中的需求具有相同的优先级，计算每个集合中每个资源的累积需求，然后按照公平共享集优先级的顺序将资源分配给需求。如果在分配过程中，给定资源的供给不能满足给定集合的给定累积需求，则给定资源按比例（例如，均匀地或根据使用比例）在有助于给定累积需求的所有需求中分配在给定的集合。这是一个先进的规划系统，用于优化既定的规划目标（例如，客户服务，交货期短，库存低，供应和容量优先分配），以计算企业的可行生产计划。

18. 发明申请

US20090216583A1 APPROXIMATING CYCLE TIMES WITHIN MATERIAL FLOW NETWORK 失效
标题翻译：在材料流网络中大大缩短周期时间
公开(公告)号：US20090216583A1
公开(公告)日：2009-08-27
申请号：US12038134
申请日：2008-02-27
申请人： Alfred Degbotse , Brian T. Denton , Robert J. Milne
发明人： Alfred Degbotse , Brian T. Denton , Robert J. Milne
IPC分类号： G06Q10/00
CPC分类号： G06Q10/06 , G06Q10/06312 , G06Q10/0633 , G06Q10/0875 , G06Q50/06
摘要： Approximating cycle times within a material flow network is disclosed. One embodiment includes assigning an approximate cycle time for completion of a part number PN within the material flow network by using a model that rounds the approximate cycle time to a nearest aggregate time period and adjusting the assigned approximate cycle time based on a mathematical function representing an aggregate accuracy of an aggregation of cycle times throughout the material flow network.
摘要翻译：公开了材料流网络内的近似循环时间。一个实施例包括通过使用将近似周期时间舍入到最近聚合时间周期的模型来分配在材料流网络内完成零件号PN的近似周期时间，并且基于表示整个材料流网络周期时间聚合的聚合精度。

19. 发明申请

US20080221962A1 Method for Fair Sharing Limited Resources Between Multiple Customers 失效
标题翻译：公平共享方法多个客户之间的有限资源
公开(公告)号：US20080221962A1
公开(公告)日：2008-09-11
申请号：US12125193
申请日：2008-05-22
申请人： Brian T. Denton , Robert J. Milne , Chi-Tai Wang
发明人： Brian T. Denton , Robert J. Milne , Chi-Tai Wang
IPC分类号： G06Q10/00
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.
摘要翻译：所公开的发明包括一种在线性规划生产计划系统中通过首先将需求分类为公平共享集合来创建生产计划时，鼓励在多个客户之间公平共享有限物料库存和容量的方法，该方法通过在线性规划生产计划系统中的竞争需求中分配资源，其中所有每个集合中的需求具有相同的优先级，计算每个集合中每个资源的累积需求，然后按照公平共享集优先级的顺序将资源分配给需求。如果在分配过程中，给定资源的供给不能满足给定集合的给定累积需求，则给定资源按比例（例如，均匀地或根据使用比例）在有助于给定累积需求的所有需求中分配在给定的集合。这是一个先进的规划系统，用于优化既定的规划目标（例如，客户服务，交货期短，库存低，供应和容量优先分配），以计算企业的可行生产计划。

20. 发明授权

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.
摘要翻译：本发明提供了一种用于确定生产计划的方法和系统，其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。更具体地，本发明提出了一种使用线性规划生产计划系统在制造设施（例如，晶圆代工厂）中分配生产开始（例如，晶片启动）的方法，线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产一旦满足最小启动约束，则开始约束，随后是线性规划的第二阶段以满足附加约束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式