会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method for purchase order rescheduling in a linear program
    • 在线性程序中重新安排采购订单的方法
    • US07966208B2
    • 2011-06-21
    • US10707974
    • 2004-01-29
    • Brian T. DentonRobert J. MilneRobert A. Orzell
    • Brian T. DentonRobert J. MilneRobert A. Orzell
    • G06Q10/00
    • G06Q10/06G06Q10/0631G06Q10/06312G06Q10/06314G06Q10/06315G06Q30/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.
    • 本发明提供了一种重新安排在线性规划生产计划系统中调度在采购订单上的物品被接收的时间的方法。 该方法对购买订单收据的定时进行预处理重新安排到预处理步骤中允许的最早时间段。 在这种预处理之后,本发明使用重新安排的采购订单收据来解决核心生产计划系统方程式。 然后,本发明执行后处理重新安排,其根据重新安排的灵活性对采购订单收据进行排序,然后按照分类处理建立的顺序顺序重新安排每个采购单收货的定时。 该顺序重新安排的过程将购买订单收据的时间安排到允许的最新时间段内。
    • 5. 发明申请
    • SUPPLY CONSUMPTION OPTIMIZATION AND MULTIPLE COMPONENT UTILITZATION
    • 供应消费优化和多元组件利用
    • US20090222312A1
    • 2009-09-03
    • US12468203
    • 2009-05-19
    • Alfred T. DegbotseRobert J. MilneRobert A. Orzell
    • Alfred T. DegbotseRobert J. MilneRobert A. Orzell
    • G06Q10/00G06F19/00
    • G06Q10/04G06Q10/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.
    • 这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。 该方法迭代了需求,以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。 本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求,并且以随后的需求结束,这些需求可以根据其相对优先级抢先提供更多需求。 另外的实施例转换需求以创建多个需求记录,每个需求记录具有相关联的优先级,使得单个原始需求记录被转换成多个相关需求记录,每个相关需求记录具有相关联的优先级。 部件供应量累计到期末存货。 该方法将多个需求记录(优先顺序)与结束库存期间相匹配。
    • 6. 发明授权
    • Method for optimizing foundry capacity
    • 优化铸造能力的方法
    • US07103436B2
    • 2006-09-05
    • US10707976
    • 2004-01-29
    • Brian T. DentonRobert J. MilneRobert A. OrzellSatyadeep VajjalaJacqueline N. Ward
    • Brian T. DentonRobert J. MilneRobert A. OrzellSatyadeep VajjalaJacqueline N. Ward
    • G06F19/00
    • G06Q10/00G06Q10/04G06Q30/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.
    • 本发明提供了一种用于确定生产计划的方法和系统,其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。 更具体地,本发明提出了一种使用线性规划生产计划系统在制造设施(例如,晶圆代工厂)中分配生产开始(例如,晶片启动)的方法,线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产 一旦满足最小启动约束,则开始约束,随后是线性规划的第二阶段以满足附加约束。
    • 7. 发明授权
    • Advanced material requirements planning in microelectronics manufacturing
    • 微电子制造先进材料需求规划
    • US5943484A
    • 1999-08-24
    • US938130
    • 1997-09-26
    • Robert J. MilneRobert A. OrzellChih-Kuan Yen
    • Robert J. MilneRobert A. OrzellChih-Kuan Yen
    • G06Q10/06G06F19/00G06G7/122G06G7/50
    • G06Q10/06
    • A computer implemented decision support tool serves as an Advanced Material Requirements Planning (AMRP) solver to generate a match between existing assets and demands across multiple manufacturing facilities within the boundaries established by the manufacturing specifications and process flows and business policies to determine what (and when) is needed to start internally or purchase externally to meet all customer demands of current interest. The matching must take into account manufacturing or production specifications and business guidelines. To accomplish the task of deciding what to do when to meet customer demand, the AMRP solver explodes demands into a build plan for purchased and manufacturing orders for end items as well as components and raw materials necessary to produce those end items. The AMRP solver combines traditional MRP decision technology with linear programming (LP) decision technology to provide both speed and intelligence in the matching process.
    • 计算机实施的决策支持工具可用作高级物料需求计划(AMRP)解决方案,以在制造规范和流程流程和业务政策确定的边界内的多个制造工厂之间生成现有资产与需求之间的匹配,以确定何时 )需要从内部开始或外部购买以满足当前所有客户的需求。 匹配必须考虑到制造或生产规范和业务指南。 为了完成决定在满足客户需求方面做什么的任务,AMRP解决方案将需求扩大到最终产品的采购和制造订单的构建计划以及生产这些最终产品所需的组件和原材料。 AMRP求解器将传统MRP决策技术与线性规划(LP)决策技术相结合,在匹配过程中提供速度和智能。
    • 9. 发明授权
    • System for and method of interpolation for supply chain planning
    • 供应链计划插值系统和插值方法
    • US07738984B2
    • 2010-06-15
    • US11530999
    • 2006-09-12
    • Brian T. DentonThomas R. ErvolinaRobert J. MilneRobert A. OrzellSamik Raychaudhuri
    • Brian T. DentonThomas R. ErvolinaRobert J. MilneRobert A. OrzellSamik Raychaudhuri
    • G06F19/00
    • G06Q10/06G06Q10/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),并且生成最终生产计划。 本发明可用于将购买者和供应商之间的协作整合到用于优化既定规划目标(例如客户服务,短交货期,低库存以及供应和容量的优先分配)的高级规划系统。
    • 10. 发明申请
    • SYSTEM FOR AND METHOD OF INTERPOLATION FOR SUPPLY CHAIN PLANNING
    • 用于供应链规划的插入系统和插值方法
    • US20080071603A1
    • 2008-03-20
    • US11530999
    • 2006-09-12
    • Brian T. DentonThomas R. ErvolinaRobert J. MilneRobert A. OrzellSamik Raychaudhuri
    • Brian T. DentonThomas R. ErvolinaRobert J. MilneRobert A. OrzellSamik Raychaudhuri
    • G06F15/02G07G1/00G06F9/44
    • G06Q10/06G06Q10/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),并且生成最终生产计划。 本发明可用于将购买者和供应商之间的协作整合到用于优化既定规划目标(例如客户服务,短交货期,低库存以及供应和容量的优先分配)的高级规划系统。