-
1.发明授权Method, system and program product for determining objective function coefficients of a mathematical programming model 有权用于确定数学规划模型的目标函数系数的方法，系统和程序产品公开(公告)号：US07689592B2
公开(公告)日：2010-03-30
申请号：US11203603
申请日：2005-08-11
CPC分类号： 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.
摘要翻译： 一种用于确定数学规划模型的目标函数的多个系数的方法和系统。 识别模型的属性。 通过采用指定的属性等级来确定确定第一解并且最初表示多个系数的第一组系数值。 一个普遍的解决方案被初始化为第一个解决方案。 生成额外的系数值集合，每组确定模型的相应附加解。 评估附加解决方案（例如，通过分析层级过程）以提供解决方案的排名，其中排名取决于属性。 附加解决方案的排名用于选择第二个解决方案。 如果第二个解决方案超过了主要解决方案和指定公差的总和，则将主要解决方案设置为第二个解决方案。
-
2.发明授权Method for sizing production lot starts within a linear system programming environment 有权在线性系统编程环境中开始大规模生产批量的方法公开(公告)号：US07292904B2
公开(公告)日：2007-11-06
申请号：US10605854
申请日：2003-10-31
CPC分类号： G06Q10/087 , G06Q10/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 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 rule 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.
摘要翻译： 分配有限的制造资源，实现符合客户需求的可行的生产计划是许多制造业面临的一个困难和常见的问题。 对于大规模多级制造系统，现有方法通常基于依次分配有限资源，根据生产开始的优先排序列表或基于线性规划的模型。 这种规划模型的产出是一个生产计划，其中规定了每个工厂生产的每个部件的数量，使用企业可用的资源。 通常，定义许可生产开始数量的批量规则。 本文公开的发明是一种将这些规则应用于在线性程序内的生产开始批量生产的方法。 它采用先进的启发式方法，既考虑既定的经营目标（例如客户服务，交货时间短，库存量低，供应和容量优先分配）和批量规则，以有效地计算出该部门的可行生产计划。
-
3.发明授权Method, apparatus and computer program product for organizing hierarchical information 失效用于组织层次信息的方法，装置和计算机程序产品公开(公告)号：US07885958B2
公开(公告)日：2011-02-08
申请号：US11276373
申请日：2006-02-27
CPC分类号： G06Q10/00
摘要： A method, apparatus, and computer program product for organizing hierarchical information according to a defined objective.
摘要翻译： 一种用于根据定义的目标组织分层信息的方法，装置和计算机程序产品。
-
4.发明授权公开(公告)号：US08165704B2
公开(公告)日：2012-04-24
申请号：US12349599
申请日：2009-01-07
申请人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
发明人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
CPC分类号： G05B19/41865 , G05B2219/32263 , G05B2219/32304 , G06Q10/0631 , Y02P90/20 , Y02P90/265
摘要： A method and computer program product for scheduling product lots through operations of a manufacturing line. The method including: selecting a set of sequential operations required to manufacture the lots; partitioning the product lots into designated lots and non-designated lots; and generating a release schedule for each of the non-designated lots into one or more operations of the set of sequential operations; generating a release schedule for each of the designated lots into each operation of set of sequential operations such that for each designated lot a total amount of time measured from completion of a first operation of the set of sequential operations through start of a last operation of the set of sequential operations does not exceed a target amount of time for the designated lots.
摘要翻译： 一种用于通过生产线的操作调度产品批次的方法和计算机程序产品。 该方法包括：选择制造批次所需的一组顺序操作; 将产品划分为指定地段和非指定地段; 以及为每个所述非指定批次生成一组所述顺序操作的一个或多个操作的释放时间表; 将每个指定批次的发布时间表生成到顺序操作集合的每个操作中，使得对于每个指定批次，通过开始上一次操作的顺序操作的集合的第一操作的完成来测量的总时间量 一系列连续操作不超过指定批次的目标时间。
-
5.发明申请公开(公告)号：US20090138114A1
公开(公告)日：2009-05-28
申请号：US12349599
申请日：2009-01-07
申请人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
发明人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
CPC分类号： G05B19/41865 , G05B2219/32263 , G05B2219/32304 , G06Q10/0631 , Y02P90/20 , Y02P90/265
摘要： A method and computer program product for scheduling product lots through operations of a manufacturing line. The method including: selecting a set of sequential operations required to manufacture the lots; partitioning the product lots into designated lots and non-designated lots; and generating a release schedule for each of the non-designated lots into one or more operations of the set of sequential operations; generating a release schedule for each of the designated lots into each operation of set of sequential operations such that for each designated lot a total amount of time measured from completion of a first operation of the set of sequential operations through start of a last operation of the set of sequential operations does not exceed a target amount of time for the designated lots.
摘要翻译： 一种用于通过生产线的操作调度产品批次的方法和计算机程序产品。 该方法包括：选择制造批次所需的一组顺序操作; 将产品划分为指定地段和非指定地段; 以及为每个所述非指定批次生成一组所述顺序操作的一个或多个操作的释放时间表; 将每个指定批次的发布时间表生成到顺序操作集合的每个操作中，使得对于每个指定批次，通过开始上一次操作的顺序操作的集合的第一操作的完成来测量的总时间量 一系列连续操作不超过指定批次的目标时间。
-
公开(公告)号：US06983190B2
公开(公告)日：2006-01-03
申请号：US10605735
申请日：2003-10-22
IPC分类号： G06F19/00
摘要： Disclosed is a method and system for efficiently modeling the situation where a product manufactured within a multi-stage manufacturing system has components upstream in the supply chain which may substitute for one another. The invention selectively permits substitutions based on rules associated with downstream operations or customer shipments. One component may substitute for another provided that the assembly consuming the component belongs to a certain set of assemblies. The invention also encompasses a method by which this can be integrated into a production planning system based on a linear programming (LP) model.
摘要翻译： 公开了一种用于有效建模在多级制造系统内制造的产品具有在供应链中可以相互代替的组件的情况的方法和系统。 本发明基于与下游操作或客户出货相关的规则选择性地允许替换。 一个组件可以替代另一个组件，只要消耗组件的组件属于某组集合。 本发明还包括一种可以将其集成到基于线性规划（LP）模型的生产计划系统中的方法。
-
7.发明授权公开(公告)号：US07477958B2
公开(公告)日：2009-01-13
申请号：US10908420
申请日：2005-05-11
申请人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
发明人： Richard Gerard Burda , Alfred Degbotse , Brian Trevor Denton , Kenneth Jeffrey Fordyce , Robert John Milne
IPC分类号： G06F19/00
CPC分类号： G05B19/41865 , G05B2219/32263 , G05B2219/32304 , G06Q10/0631 , Y02P90/20 , Y02P90/265
摘要： A method and computer program product for scheduling product lots through operations of a manufacturing line. The method including: selecting a sequential subset of a set of sequential operations required to manufacture the lots; partitioning the product lots into designated lots and non-designated lots; and generating a release schedule for each of the non-designated lots into one or more operations of the sequential subset of the set of sequential operations; generating a release schedule for each of the designated lots into each operation of the sequential subset of the set of sequential operations such that for each designated lot a total amount of time measured from completion of a first operation of the sequential subset of the set of sequential operations through start of a last operation of the sequential subset of the set of sequential operations does not exceed a target amount of time for the designated lots.
摘要翻译： 一种用于通过生产线的操作调度产品批次的方法和计算机程序产品。 该方法包括：选择制造批次所需的一组顺序操作的顺序子集; 将产品划分为指定地段和非指定地段; 以及将所述非指定批次中的每一个生成到所述一组顺序操作的顺序子集的一个或多个操作中的释放时间表; 为每个指定批次的每个操作生成顺序操作的顺序子集的每个操作的发布时间表，使得对于每个指定批次，从完成该顺序集合的顺序子集的第一操作所测量的总时间量 通过开始该顺序操作的顺序子集的最后操作的操作不超过指定批次的目标时间量。
-
8.发明授权Method for allocating limited component supply and capacity to optimize production scheduling 有权分配有限的组件供应和容量以优化生产调度的方法公开(公告)号：US07197469B2
公开(公告)日：2007-03-27
申请号：US09891850
申请日：2001-06-26
申请人： Sanjay R. Hegde , Robert John Milne , Robert A. Orzell , Mahesh Chandra Pati , Shivakumar P. Patil
发明人： Sanjay R. Hegde , Robert John Milne , Robert A. Orzell , Mahesh Chandra Pati , Shivakumar P. Patil
IPC分类号： G06F9/46
CPC分类号： G06Q10/06312 , G06Q10/06 , G06Q10/06315 , G06Q10/087 , Y02P90/86
摘要： A method and system for resource rationing which employs decision rules for the optimal allocation of supply and capacity over time that satisfy two key requirements (a) being consistent with accepted operational objectives (e.g. low inventory, short lead times, prioritized allocation of supply and capacity) and (b) allowing for the timely computation of a feasible production schedule. The method and system is generally characterized in that it is able to divide each of the priority ranked scheduled releases (Material Requirements Planning (MRP)) into “N” separate and smaller sized scheduled releases where the priority of each of the “N” releases may be equal to the priority of the original release. The “N” separate and smaller sized scheduled releases are sorted according to priority and then used to determine an optimal supply schedule for allocating resources including component supply and assembly capacity.
摘要翻译： 一种用于资源配给的方法和系统，其使用满足两个关键要求的供应和容量的最佳分配的决策规则（a）与所接受的操作目标一致（例如，低库存，交货时间短，供应和容量优先分配 ）和（b）允许及时计算可行的生产计划。 该方法和系统的特征在于，能够将优先级排序的排放（物料需求计划（MRP））中的每一个划分为“N”个单独和较小规模的排放发布，其中每个“N”版本的优先级 可能等于原版本的优先级。 根据优先级对“N”个不同规模的较小规模发布进行排序，然后用于确定用于分配资源（包括组件供应和组装能力）的最佳供应计划。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.027 秒)
