-
1.发明授权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.
摘要翻译： 一种随时间有效分配有限制造资源以满足客户需求的方法和系统。 在企业规划层面，这通常需要确定扩展供应链的可行生产计划。 该方法和系统基于产品和过程考虑，利用新的和独特的系统分解类型。 这种方法同时降低了模型大小（并因此降低了计算时间），并且提高了基于严格线性规划的决策制定的建模灵活性，从而包括更一般的非线性规划特
-
2.发明授权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”个不同规模的较小规模发布进行排序，然后用于确定用于分配资源（包括组件供应和组装能力）的最佳供应计划。
-
3.发明授权Method for identifying product assets in a supply chain used to satisfy multiple customer demands 有权用于识别用于满足多个客户需求的供应链中的产品资产的方法公开(公告)号：US07606743B2
公开(公告)日：2009-10-20
申请号：US10708119
申请日：2004-02-10
CPC分类号： G06Q10/087 , G06Q20/203
摘要： A method, a system for practicing the method and a storage device storing the method for identifying product assets in a supply chain used to satisfy customer demands. The method including: receiving a feasible schedule of all components to be assembled into products; receiving customer schedules for delivery of the products; and generating from the feasible schedule, from the customer schedules and from bills of materials listing all components required for a particular product, a set of demand pegging records, the demand pegging records associating a quantity and an availability date of each component of each product with a required quantity of each of the products, each demand pegging record consistent with the feasible schedule.
摘要翻译： 一种用于实施该方法的方法，以及存储用于识别用于满足客户需求的供应链中的产品资产的方法的存储装置。 该方法包括：收集要组装成产品的所有组件的可行计划; 接收客户的交货时间表; 并从可行的时间表中，从客户日程表和从列出特定产品所需的所有组件的材料清单，一组需求挂钩记录，将每个产品的每个组件的数量和可用性日期与每个产品的可用性日期相关联的需求挂钩记录与 每个产品所需数量，每个需求挂钩记录符合可行的进度。
-
4.发明授权Method for resource allocation and re-grouping recognizing competing priorities which vary by date 失效资源分配和重新分组的方法，识别随日期变化的竞争优先事项公开(公告)号：US07515983B2
公开(公告)日：2009-04-07
申请号：US11776789
申请日：2007-07-12
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06Q10/0631 , G06Q10/06316 , G06Q10/087
摘要： A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.
摘要翻译： 一种方法通过输入生产开始确定制造环境中的生产开始。 该方法根据分组规则将生产开始分成生产批次，并根据业务优先级为每个生产批次分配开始日期和相关优先级。 生产批次的每个生产开始日期可以有不同的优先级。 该方法根据相关优先级和开始日期对生产批次进行排序。 然后，该方法通过迭代生产批次对生产批次进行了生产，以便根据相关优先事项和开始日期将生产能力分配给生产批次。
-
5.发明授权Method for resource allocation and re-grouping recognizing competing priorities which vary by date 失效资源分配和重新分组的方法，识别随日期变化的竞争优先事项公开(公告)号：US07286889B1
公开(公告)日：2007-10-23
申请号：US11278821
申请日：2006-04-06
IPC分类号： G06F19/00
CPC分类号： G06Q10/06 , G06Q10/0631 , G06Q10/06316 , G06Q10/087
摘要： A method determines production starts in a manufacturing environment by inputting production starts. The method groups the production starts into production lots according to grouping rules and assigns start dates and associated priorities to each of the production lots based on business priorities. Each production start date of a production lot can have a different priority. The method sorts the production lots according to the associated priorities and the start dates. Then the method capacitates the production lots by iterating through the production lots to assign production capacity to the production lots in order of the associated priorities and the start dates.
摘要翻译： 一种方法通过输入生产开始确定制造环境中的生产开始。 该方法根据分组规则将生产开始分成生产批次，并根据业务优先级为每个生产批次分配开始日期和相关优先级。 生产批次的每个生产开始日期可以有不同的优先级。 该方法根据相关优先级和开始日期对生产批次进行排序。 然后，该方法通过迭代生产批次对生产批次进行了生产，以便根据相关优先事项和开始日期将生产能力分配给生产批次。
-
公开(公告)号：US06584370B2
公开(公告)日：2003-06-24
申请号：US09891554
申请日：2001-06-26
IPC分类号： G06F1524
CPC分类号： G06Q10/0875 , G06Q10/087
摘要： A method and system for controlling sequential capacity allocation through modification of traditional low level codes (LLC). The method and system of the present invention employs a systematic set of decision rules for interactively adjusting LLCs so that they are consistent with interdependencies of resources among parts due to resource sharing.
-
公开(公告)号：US07103436B2
公开(公告)日：2006-09-05
申请号：US10707976
申请日：2004-01-29
IPC分类号： G06F19/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.
摘要翻译： 本发明提供了一种用于确定生产计划的方法和系统，其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。 更具体地，本发明提出了一种使用线性规划生产计划系统在制造设施（例如，晶圆代工厂）中分配生产开始（例如，晶片启动）的方法，线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产 一旦满足最小启动约束，则开始约束，随后是线性规划的第二阶段以满足附加约束。
-
公开(公告)号：US5943484A
公开(公告)日：1999-08-24
申请号：US938130
申请日：1997-09-26
申请人： Robert J. Milne , Robert A. Orzell , Chih-Kuan Yen
发明人： Robert J. Milne , Robert A. Orzell , Chih-Kuan Yen
CPC分类号： 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）决策技术相结合，在匹配过程中提供速度和智能。
-
公开(公告)号：US07966208B2
公开(公告)日：2011-06-21
申请号：US10707974
申请日：2004-01-29
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.
摘要翻译： 本发明提供了一种重新安排在线性规划生产计划系统中调度在采购订单上的物品被接收的时间的方法。 该方法对购买订单收据的定时进行预处理重新安排到预处理步骤中允许的最早时间段。 在这种预处理之后，本发明使用重新安排的采购订单收据来解决核心生产计划系统方程式。 然后，本发明执行后处理重新安排，其根据重新安排的灵活性对采购订单收据进行排序，然后按照分类处理建立的顺序顺序重新安排每个采购单收货的定时。 该顺序重新安排的过程将购买订单收据的时间安排到允许的最新时间段内。
-
公开(公告)号：US20090222312A1
公开(公告)日：2009-09-03
申请号：US12468203
申请日：2009-05-19
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.
摘要翻译： 这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。 该方法迭代了需求，以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。 本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求，并且以随后的需求结束，这些需求可以根据其相对优先级抢先提供更多需求。 另外的实施例转换需求以创建多个需求记录，每个需求记录具有相关联的优先级，使得单个原始需求记录被转换成多个相关需求记录，每个相关需求记录具有相关联的优先级。 部件供应量累计到期末存货。 该方法将多个需求记录（优先顺序）与结束库存期间相匹配。
-
-
-
-
-
-
-
-
-
搜索结果
22 条记录 (耗时 0.046 秒)
