公开(公告)号：US20070239299A1

公开(公告)日：2007-10-11

申请号：US11278817

申请日：2006-04-06

申请人： Robert Milne ,  Robert Orzell ,  Chi-Tai Wang

发明人： Robert Milne ,  Robert Orzell ,  Chi-Tai Wang

IPC分类号： G06F19/00

CPC分类号： G06Q10/06 ,  G06Q10/087

摘要： A production planning method inputs demands for products. The demands have multiple due dates, and the multiple due dates have different priorities. The method performs an explosion process utilizing linear programming and heuristics to identify demands for components that are used to make the products (the explosion process maintains the multiple due dates and corresponding priorities for the components) and performs an implosion process utilizing linear programming and heuristics to assign resources to the components considering the multiple due dates and corresponding priorities.

摘要翻译： 生产计划方法输入对产品的需求。 需求有多个到期日，多个到期日期有不同的优先顺序。 该方法使用线性规划和启发式方法来执行爆炸过程，以识别用于制造产品的组件的需求（爆炸过程保持组件的多个到期日期和相应的优先级），并使用线性规划和启发式进行内爆过程 考虑多个到期日期和相应的优先级，为组件分配资源。

公开(公告)号：US20070239304A1

公开(公告)日：2007-10-11

申请号：US11278818

申请日：2006-04-06

申请人： Robert Orzell

发明人： Robert Orzell

IPC分类号： G06F19/00

CPC分类号： G06Q10/087

摘要： The methodology disclosed herein calculates the dates that product must come to stock for every component in the supply chain as needed to meet exit demands associated with a plurality of due dates and priorities. Every planned product stock is thus associated with multiple stock dates and associated priorities as is every planned manufacturing start and every shipment.

摘要翻译： 本文所公开的方法计算产品必须为供应链中的每个部件必须到达的日期以满足与多个到期日期和优先级相关联的退出需求。 因此，每个计划的产品库存都与多个库存日期和相关优先事项相关联，因为每个计划的制造开始和每个装运。

公开(公告)号：US20070239301A1

公开(公告)日：2007-10-11

申请号：US11278821

申请日：2006-04-06

申请人： Robert Orzell ,  Shivakumar Patil

发明人： Robert Orzell ,  Shivakumar Patil

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.

摘要翻译： 一种方法通过输入生产开始确定制造环境中的生产开始。 该方法根据分组规则将生产开始分成生产批次，并根据业务优先级为每个生产批次分配开始日期和相关优先级。 生产批次的每个生产开始日期可以有不同的优先级。 该方法根据相关优先级和开始日期对生产批次进行排序。 然后，该方法通过迭代生产批次对生产批次进行了生产，以便根据相关优先事项和开始日期将生产能力分配给生产批次。

公开(公告)号：US20050171625A1

公开(公告)日：2005-08-04

申请号：US10707976

申请日：2004-01-29

申请人： Brian Denton ,  Robert Milne ,  Robert Orzell ,  Satyadeep Vajjala ,  Jacqueline Ward

发明人： Brian Denton ,  Robert Milne ,  Robert Orzell ,  Satyadeep Vajjala ,  Jacqueline 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.

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

公开(公告)号：US20080015724A1

公开(公告)日：2008-01-17

申请号：US11776789

申请日：2007-07-12

申请人： Robert Orzell ,  Shivakumar Patil

发明人： Robert Orzell ,  Shivakumar Patil

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.

摘要翻译： 一种方法通过输入生产开始确定制造环境中的生产开始。 该方法根据分组规则将生产开始分成生产批次，并根据业务优先级为每个生产批次分配开始日期和相关优先级。 生产批次的每个生产开始日期可以有不同的优先级。 该方法根据相关优先级和开始日期对生产批次进行排序。 然后，该方法通过迭代生产批次对生产批次进行了生产，以便根据相关优先事项和开始日期将生产能力分配给生产批次。

公开(公告)号：US20050171825A1

公开(公告)日：2005-08-04

申请号：US10707974

申请日：2004-01-29

申请人： Brian Denton ,  Robert Milne ,  Robert Orzell

发明人： Brian Denton ,  Robert Milne ,  Robert Orzell

IPC分类号： G06Q10/00 ,  G06Q30/00 ,  G06F17/60

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.

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

公开(公告)号：US20070239297A1

公开(公告)日：2007-10-11

申请号：US11278819

申请日：2006-04-06

申请人： Alfred Degbotse ,  Robert Milne ,  Robert Orzell

发明人： Alfred Degbotse ,  Robert Milne ,  Robert Orzell

IPC分类号： G06F19/00 ,  G07G1/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.

摘要翻译： 这里公开的发明是用于实现与单个需求相关联的多个独立日期的同时考虑的方法。 该方法迭代了需求，以满足需求优先级的供应量和随时间变化的需求量以及可能随时间而灭亡的需求量。 本发明的一个实施例通过从先前的需求要求日期开始的迭代过程来分配需求，并且以随后的需求结束，这些需求可以根据其相对优先级抢先提供更多需求。 另外的实施例转换需求以创建多个需求记录，每个需求记录具有相关联的优先级，使得单个原始需求记录被转换成多个相关需求记录，每个相关需求记录具有相关联的优先级。 部件供应量累计到期末存货。 该方法将多个需求记录（优先顺序）与结束库存期间相匹配。

公开(公告)号：US20050177465A1

公开(公告)日：2005-08-11

申请号：US10708119

申请日：2004-02-10

申请人： Robert Orzell ,  Shivakumar Patil ,  Chi-Tai Wang

发明人： Robert Orzell ,  Shivakumar Patil ,  Chi-Tai Wang

IPC分类号： G06Q10/00 ,  G06F17/60

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.

摘要翻译： 一种用于实施该方法的方法，以及存储用于识别用于满足客户需求的供应链中的产品资产的方法的存储装置。 该方法包括：收集要组装成产品的所有组件的可行计划; 接收客户的交货时间表; 并从可行的时间表中，从客户日程表和从列出特定产品所需的所有组件的材料清单，一组需求挂钩记录，将每个产品的每个组件的数量和可用性日期与每个产品的可用性日期相关联的需求挂钩记录与 每个产品所需数量，每个需求挂钩记录符合可行的进度。