会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 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.
    • 本发明提供了一种用于确定生产计划的方法和系统,其包括确定满足合同义务所需的制造开始的最小数量的第一步骤; 并且确定满足最小制造的生产计划的第二步骤与其他客户需求一起开始。 更具体地,本发明提出了一种使用线性规划生产计划系统在制造设施(例如,晶圆代工厂)中分配生产开始(例如,晶片启动)的方法,线性规划生产计划系统执行线性规划的第一阶段以仅满足合同规定的最小生产 一旦满足最小启动约束,则开始约束,随后是线性规划的第二阶段以满足附加约束。
    • 2. 发明申请
    • METHOD, SYSTEM AND PROGRAM STORAGE DEVICE FOR PRODUCTION PLANNING
    • 用于生产计划的方法,系统和程序存储设备
    • US20130103456A1
    • 2013-04-25
    • US13280489
    • 2011-10-25
    • ALLISON R. BANNISTERRobert A. OrzellJames J. SchickJacqueline N. Ward
    • ALLISON R. BANNISTERRobert A. OrzellJames J. SchickJacqueline N. Ward
    • G06Q10/06
    • G06Q10/06
    • Disclosed are embodiments of a production planning method, system and program storage device. The embodiments calculate and compare, in sequence, a first running cumulative sum of the average item quantity per a regular time interval for all demands within a specified time period and a second running cumulative sum of specific item quantities per the same regular interval for only high priority demands within the same time period. When a given entry in the first running cumulative sum is less than a corresponding entry in the second running cumulative sum, demand leveling is performed. Comparing and demand leveling are iteratively repeated until no entries in the first running cumulative sum, as updated, are less than corresponding entries in the second running cumulative sum. The results can then be used for production planning in order to achieve near-capacity manufacturing and meet at least the high priority customer demands.
    • 公开了生产计划方法,系统和程序存储装置的实施例。 实施例按顺序计算并比较在规定时间段内的所有需求的每个常规时间间隔的平均料品数量的第一运行累计和和每个相同规则间隔的特定料品数量的第二运行累加和仅为高 同一时间段内的优先需求。 当第一运行累加和中的给定条目小于第二运行累积和中的对应条目时,执行需求调平。 迭代地重复比较和需求调平,直到第一次运行的累加和(如更新的)中的条目少于第二个运行累积和中的相应条目为止。 然后可以将结果用于生产计划,以实现近容量制造,并满足至少高优先级客户需求。