Profit optimization
    2.
    发明申请
    Profit optimization 审中-公开
    利润优化

    公开(公告)号:US20050149377A1

    公开(公告)日:2005-07-07

    申请号:US10498685

    申请日:2002-12-12

    申请人: Hans Schierholt

    发明人: Hans Schierholt

    IPC分类号: G06Q10/06 G06Q30/02 G06F17/60

    摘要: Profit optimization methods and systems for a supply chain are described. An implementation of the technique includes determining the initial cost of components required to manufacture a product, dynamically determining the cost for substitution of at least one product component, dynamically determining the location of at least one substitute component, and manufacturing the product for the lowest cost based on the results of the cost of substittuion and substitute component location determinations. At least one of the cost of substitute components and the component locations may be determined at or near the time of manufacture.

    摘要翻译: 描述了供应链的利润优化方法和系统。 该技术的实现包括确定制造产品所需的部件的初始成本,动态地确定代替至少一个产品部件的成本,动态地确定至少一个替代部件的位置,以及以最低成本制造产品 基于取代成本和替代部件位置确定的结果。 替代部件和部件位置的成本中的至少一个可以在制造时或接近制造时确定。

    System and method for service parts planning in a multi-echelon network
    3.
    发明申请
    System and method for service parts planning in a multi-echelon network 有权
    多层次网络中服务部件规划的系统和方法

    公开(公告)号:US20060031084A1

    公开(公告)日:2006-02-09

    申请号:US11065393

    申请日:2005-02-22

    IPC分类号: G06Q99/00

    摘要: Embodiments of the invention are generally directed to a system and method for service parts planning in a multi-echelon network having one or more service parts. For at least a subset of the one or more service parts, a calculation is performed to determine a location within the multi-echelon network at which allocating the service part provides the greatest gain in system availability per item cost. In one embodiment, the calculations take into consideration violations of incremental optimal allocation. In an embodiment, the calculations take into consideration violations of convexity.

    摘要翻译: 本发明的实施例一般涉及具有一个或多个服务部分的多梯形网络中的服务部件规划的系统和方法。 对于一个或多个服务部分的至少一个子集,执行计算以确定在多梯队网络中的位置,在该位置中,分配服务部分在每个项目成本的系统可用性中提供最大的增益。 在一个实施例中,计算考虑到违反增量最优分配。 在一个实施例中,计算考虑到侵蚀凸度。

    System and method for service parts planning

    公开(公告)号:US20060020485A1

    公开(公告)日:2006-01-26

    申请号:US11064665

    申请日:2005-02-22

    IPC分类号: G06Q99/00

    摘要: Embodiments of the invention are generally directed to a system and method for service parts planning in a network having one or more service parts. For at least a subset of the one or more service parts, a calculation is performed to determine a location within the network at which allocating the service part provides the greatest gain in system availability per item cost. In an embodiment, the calculations are based, at least in part on machine-specific information. In one embodiment, inventory position is determined based, at least in part, on a unique identifier associated with a service part.