会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • METHOD FOR PURCHASE ORDER RESCHEDULING IN A LINEAR PROGRAM
    • 在线性程序中购买订购订购方法
    • US20050171825A1
    • 2005-08-04
    • US10707974
    • 2004-01-29
    • Brian DentonRobert MilneRobert Orzell
    • Brian DentonRobert MilneRobert Orzell
    • G06Q10/00G06Q30/00G06F17/60
    • 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.
    • 本发明提供了一种重新安排在线性规划生产计划系统中调度在采购订单上的物品被接收的时间的方法。 该方法对购买订单收据的定时进行预处理重新安排到预处理步骤中允许的最早时间段。 在这种预处理之后,本发明使用重新安排的采购订单收据来解决核心生产计划系统方程式。 然后,本发明执行后处理重新安排,其根据重新安排的灵活性对采购订单收据进行排序,然后按照分类处理建立的顺序顺序重新安排每个采购单收货的定时。 该顺序重新安排的过程将购买订单收据的时间安排到允许的最新时间段内。
    • 2. 发明申请
    • A METHOD FOR OPTIMIZING FOUNDRY CAPACITY
    • 一种优化基础能力的方法
    • US20050171625A1
    • 2005-08-04
    • US10707976
    • 2004-01-29
    • Brian DentonRobert MilneRobert OrzellSatyadeep VajjalaJacqueline Ward
    • Brian DentonRobert MilneRobert OrzellSatyadeep VajjalaJacqueline 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.
    • 本发明提供了一种用于确定生产计划的方法和系统,其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。 更具体地,本发明提出了一种使用线性规划生产计划系统在制造设施(例如,晶圆代工厂)中分配生产开始(例如,晶片启动)的方法,线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产 一旦满足最小启动约束,则开始约束,随后是线性规划的第二阶段以满足附加约束。
    • 4. 发明申请
    • SUPPLY CONSUMPTION OPTIMIZATION AND MULTIPLE COMPONENT UTILIZATION
    • 供应消费优化和多元组件利用
    • US20070239297A1
    • 2007-10-11
    • US11278819
    • 2006-04-06
    • Alfred DegbotseRobert MilneRobert Orzell
    • Alfred DegbotseRobert MilneRobert Orzell
    • G06F19/00G07G1/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.
    • 这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。 该方法迭代了需求,以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。 本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求,并且以随后的需求结束,这些需求可以根据其相对优先级抢先提供更多需求。 另外的实施例转换需求以创建多个需求记录,每个需求记录具有相关联的优先级,使得单个原始需求记录被转换成多个相关需求记录,每个相关需求记录具有相关联的优先级。 部件供应量累计到期末存货。 该方法将多个需求记录(优先顺序)与结束库存期间相匹配。
    • 5. 发明申请
    • METHOD FOR SIZING PRODUCTION LOT STARTS WITHIN A LINEAR SYSTEM PROGRAMMING ENVIRONMENT
    • 在线性系统编程环境中生产最大起点的方法
    • US20050096771A1
    • 2005-05-05
    • US10605854
    • 2003-10-31
    • Brian DentonJohn ForrestRobert Milne
    • Brian DentonJohn ForrestRobert Milne
    • G06F19/00G06Q10/00
    • G06Q10/087G06Q10/06
    • Allocating limited manufacturing resources to achieve a feasible production plan that is consistent with customer demand is a difficult and common problem faced in many manufacturing industries. For large-scale multi-stage manufacturing systems, existing methods are typically based either on allocating limited resources sequentially, according to a priority ranked list of production starts, or on linear programming based models. The output of such planning models is a production plan which specifies the quantity of each part to produce at each plant, using resources available to the enterprise. Typically there are lot-sizing rules defining the permissible production start quantities. The invention disclosed herein is a method for applying these rules to the lot-sizing of production starts within a linear program. It employs advanced heuristics that consider both established operational objectives (e.g. customer service, short lead times, low inventory, and prioritized allocation of supply and capacity) and lot-size rules to efficiently compute a feasible production plan for the division.
    • 分配有限的制造资源,实现符合客户需求的可行的生产计划是许多制造业面临的一个困难和常见的问题。 对于大型多级制造系统,现有方法通常基于依次分配有限资源,根据优先排序的生产启动列表,或基于线性规划的模型。 这种规划模型的产出是一个生产计划,其中规定了每个工厂生产的每个部件的数量,使用企业可用的资源。 通常,定义许可生产开始数量的批量规则。 本文公开的发明是一种将这些规则应用于在线性程序内的生产开始批量生产的方法。 它采用先进的启发式方法,考虑既定的经营目标(例如客户服务,交货时间短,库存量低,供应和容量优先分配)和批量规则,以有效地计算出该部门的可行生产计划。
    • 7. 发明申请
    • Method, system and program product for determining objective function coefficients of a mathematical programming model
    • 用于确定数学规划模型的目标函数系数的方法,系统和程序产品
    • US20070038657A1
    • 2007-02-15
    • US11203603
    • 2005-08-11
    • Brian DentonRobert MilneRahul NaharMark PleszkochVivek Sharma
    • Brian DentonRobert MilneRahul NaharMark PleszkochVivek Sharma
    • G06F7/00
    • G06Q10/04
    • A method and system for determining a plurality of coefficients of an objective function of a mathematical programming model. Attributes of the model are identified. A first set of coefficient values determining a first solution and initially representing the plurality of coefficients is determined by employing a specified ranking of the attributes. A prevailing solution is initialized to the first solution. Additional sets of coefficient values are generated, each set determining a corresponding additional solution of the model. The additional solutions are evaluated (e.g., by the Analytic Hierarchy Process) to provide a ranking of the solutions, where the ranking is dependent upon the attributes. The ranking of the additional solutions is used to select a second solution. The prevailing solution is set to the second solution if the second solution exceeds a sum of the prevailing solution and a specified tolerance.
    • 一种用于确定数学规划模型的目标函数的多个系数的方法和系统。 识别模型的属性。 通过采用指定的属性等级来确定确定第一解并且最初表示多个系数的第一组系数值。 一个普遍的解决方案被初始化为第一个解决方案。 生成额外的系数值集合,每组确定模型的相应附加解。 评估附加解决方案(例如,通过分析层级过程)以提供解决方案的排名,其中排名取决于属性。 附加解决方案的排名用于选择第二个解决方案。 如果第二个解决方案超过了主要解决方案和指定公差的总和,则将主要解决方案设置为第二个解决方案。