利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

12 条记录 (耗时 0.251 秒)

    Consistency Checking and Repair of Manufacturing Operation Groupings to be Aggregated for use in Planning
    3.
    发明申请
    Consistency Checking and Repair of Manufacturing Operation Groupings to be Aggregated for use in Planning 有权
    生产经营组合的一致性检查和维修，用于规划

    公开(公告)号：US20080154411A1

    公开(公告)日：2008-06-26

    申请号：US11614854

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06F17/00

    CPC分类号： G05B19/41865 ,  G05B2219/32088 ,  G05B2219/32107 ,  G05B2219/32109 ,  Y02P90/12 ,  Y02P90/20

    摘要： Generating data used in planning the execution of a manufacturing process includes consistency checks that are performed on proposed groupings of manufacturing operations to make sure that the groupings are defined in a way that enables the information to be aggregated for use in planning. To do this, defined groupings are received for multiple execution-level manufacturing operations that are defined in a manufacturing process execution-level electronic data model and that define a process flow to produce a product. In one aspect, for each of the defined groupings, it is determined whether the defined grouping includes multiple occurrences of a process step definition that has multiple different defined alternative steps, and if so, the defined groupings are changed so that each defined grouping of the defined groupings has no more than a single occurrence of a process step definition that has multiple different defined alternative steps.

    摘要翻译： 用于规划制造过程执行过程中生成的数据包括对建议的制造操作分组执行的一致性检查，以确保以能够将信息聚合用于规划的方式定义分组。 为此，接收了在制造过程执行级电子数据模型中定义的多个执行级制造操作的定义组，并定义了生产产品的过程流程。 在一个方面，对于每个定义的分组，确定所定义的分组是否包括具有多个不同定义的备选步骤的多个出现的过程步骤定义，如果是，则定义的分组被改变，使得每个定义的分组 定义的分组具有不超过单个出现的具有多个不同定义的备选步骤的过程步骤定义。

    Consistency checking and repair of manufacturing operation groupings to be aggregated for use in planning
    4.
    发明授权
    Consistency checking and repair of manufacturing operation groupings to be aggregated for use in planning 有权
    一体化检查和维修制造业务组合，用于规划

    公开(公告)号：US07551975B2

    公开(公告)日：2009-06-23

    申请号：US11614854

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06F19/00

    CPC分类号： G05B19/41865 ,  G05B2219/32088 ,  G05B2219/32107 ,  G05B2219/32109 ,  Y02P90/12 ,  Y02P90/20

    摘要： Generating data used in planning the execution of a manufacturing process includes consistency checks that are performed on proposed groupings of manufacturing operations to make sure that the groupings are defined in a way that enables the information to be aggregated for use in planning. To do this, defined groupings are received for multiple execution-level manufacturing operations that are defined in a manufacturing process execution-level electronic data model and that define a process flow to produce a product. In one aspect, for each of the defined groupings, it is determined whether the defined grouping includes multiple occurrences of a process step definition that has multiple different defined alternative steps, and if so, the defined groupings are changed so that each defined grouping of the defined groupings has no more than a single occurrence of a process step definition that has multiple different defined alternative steps.

    摘要翻译： 用于规划制造过程执行过程中生成的数据包括对建议的制造操作分组执行的一致性检查，以确保以能够将信息聚合用于规划的方式定义分组。 为此，接收了在制造过程执行级电子数据模型中定义的多个执行级制造操作的定义组，并定义了生产产品的过程流程。 在一个方面，对于每个定义的分组，确定所定义的分组是否包括具有多个不同定义的备选步骤的多个出现的过程步骤定义，如果是，则定义的分组被改变，使得每个定义的分组 定义的分组具有不超过单个出现的具有多个不同定义的替代步骤的过程步骤定义。

    Generating Planning-Level Time and Capacity Requirement Formulas for Manufacturing Processes
    5.
    发明申请
    Generating Planning-Level Time and Capacity Requirement Formulas for Manufacturing Processes 有权
    生成制造过程的规划级时间和容量要求公式

    公开(公告)号：US20080154660A1

    公开(公告)日：2008-06-26

    申请号：US11614880

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06Q10/00

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

    摘要： Methods, computer program products and systems are disclosed for generating a planned time duration for a manufacturing process operation defined for planning purposes that includes an aggregation of multiple defined execution operations. Electronic information is received that specifies a production demand that requires use of the manufacturing process for fulfillment. A linear approximation is electronically generated of an overall time duration measure for the defined manufacturing process planning operation. The overall time duration measure is a sum of time components comprising at least a calculated measure for a variable time component for the longest of the multiple execution operations for the received production demand, and a fixed time duration measure for one send-ahead quantity for each of the multiple execution operations that is not the longest. The generated overall time duration measure is then returned.

    摘要翻译： 方法，公开了计算机程序产品和系统，用于为包括多个定义的执行操作的聚合的计划目的定义的制造过程操作生成计划的持续时间。 接收到电子信息，指定需要使用制造过程来实现的生产需求。 电子地生成用于定义的制造过程规划操作的整体持续时间测量的线性近似。 整个持续时间测量是时间分量的总和，该时间分量至少包括用于所接收的生产需求的多个执行操作中最长的可变时间分量的计算的度量，以及针对所接收的生产需求的一个发送数量的固定持续时间度量 的多个执行操作不是最长的。 然后返回生成的总体持续时间测量。

    Generating planning-level time and capacity requirement formulas for manufacturing processes
    6.
    发明授权
    Generating planning-level time and capacity requirement formulas for manufacturing processes 有权
    为制造过程生成计划级时间和容量需求公式

    公开(公告)号：US07617015B2

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

    申请号：US11614880

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06F19/00 ,  G04F7/00 ,  G04F10/00 ,  G06F9/44 ,  G06F17/50

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

    摘要： Methods, computer program products and systems are disclosed for generating a planned time duration for a manufacturing process operation defined for planning purposes that includes an aggregation of multiple defined execution operations. Electronic information is received that specifies a production demand that requires use of the manufacturing process for fulfillment. A linear approximation is electronically generated of an overall time duration measure for the defined manufacturing process planning operation. The overall time duration measure is a sum of time components comprising at least a calculated measure for a variable time component for the longest of the multiple execution operations for the received production demand, and a fixed time duration measure for one send-ahead quantity for each of the multiple execution operations that is not the longest. The generated overall time duration measure is then returned.

    摘要翻译： 方法，公开了计算机程序产品和系统，用于为包括多个定义的执行操作的聚合的计划目的定义的制造过程操作生成计划的持续时间。 接收到电子信息，指定需要使用制造过程来实现的生产需求。 电子地生成用于定义的制造过程规划操作的整体持续时间测量的线性近似。 整个持续时间测量是时间分量的总和，该时间分量至少包括用于所接收的生产需求的多个执行操作中最长的可变时间分量的计算的度量，以及针对所接收的生产需求的一个发送数量的固定持续时间度量 的多个执行操作不是最长的。 然后返回生成的总体持续时间测量。

    Structural transformation of execution-level manufacturing process routings into planning-level routings
    7.
    发明授权
    Structural transformation of execution-level manufacturing process routings into planning-level routings 有权
    执行级制造流程路由到规划级路由的结构转换

    公开(公告)号：US07894922B2

    公开(公告)日：2011-02-22

    申请号：US11614856

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06F19/00 ,  G06F9/44 ,  G06F9/46

    CPC分类号： G06Q10/06 ,  G05B19/41865 ,  Y02P90/12 ,  Y02P90/20

    摘要： Computer-implemented methods, and associated computer program products and systems, are disclosed for generating electronic data for use in planning the execution of a manufacturing process. The methods, generally, are used in the structural transformation of execution-level routings for manufacturing processes into planning-level routings. The methods applies various transformation techniques when a planning-level routing includes alternative paths, and different transformation techniques when a planning-level routing includes parallel paths. Planning modes are created in the case of alternative paths, and parallel paths generally do not cause multiple modes to be created. Parallel and alternative paths in a planning-level operation also has impacts on how the a planned duration formula is determined.

    摘要翻译： 公开了计算机实现的方法以及相关联的计算机程序产品和系统，用于生成用于规划制造过程执行的电子数据。 这些方法通常用于将制造过程的执行级路由结构转换为规划级路由。 当规划级路由包括替代路径时，该方法应用各种变换技术，并且当规划级路由包括并行路径时，该方法应用各种变换技术。 在替代路径的情况下创建规划模式，并行路径通常不会导致创建多个模式。 规划级别操作中的并行和替代路径也对如何确定计划持续时间公式产生影响。

    Structural transformation of execution-level manufacturing process routings into planning-level routings
    8.
    发明申请
    Structural transformation of execution-level manufacturing process routings into planning-level routings 有权
    执行级制造流程路由到规划级路由的结构转换

    公开(公告)号：US20080154412A1

    公开(公告)日：2008-06-26

    申请号：US11614856

    申请日：2006-12-21

    申请人： Jochen Steinbach ,  Jaakob Kind

    发明人： Jochen Steinbach ,  Jaakob Kind

    IPC分类号： G06F19/00

    CPC分类号： G06Q10/06 ,  G05B19/41865 ,  Y02P90/12 ,  Y02P90/20

    摘要： Computer-implemented methods, and associated computer program products and systems, are disclosed for generating electronic data for use in planning the execution of a manufacturing process. The methods, generally, are used in the structural transformation of execution-level routings for manufacturing processes into planning-level routings. The methods applies various transformation techniques when a planning-level routing includes alternative paths, and different transformation techniques when a planning-level routing includes parallel paths. Planning modes are created in the case of alternative paths, and parallel paths generally do not cause multiple modes to be created. Parallel and alternative paths in a planning-level operation also has impacts on how the a planned duration formula is determined.

    摘要翻译： 公开了计算机实现的方法以及相关联的计算机程序产品和系统，用于生成用于规划制造过程执行的电子数据。 这些方法通常用于将制造过程的执行级路由结构转换为规划级路由。 当规划级路由包括替代路径时，该方法应用各种变换技术，并且当规划级路由包括并行路径时，该方法应用各种变换技术。 在替代路径的情况下创建规划模式，并行路径通常不会导致创建多个模式。 规划级别操作中的并行和替代路径也对如何确定计划持续时间公式产生影响。

    METHOD AND SYSTEM FOR RECURSION CHECK AND LOW-LEVEL CODE GENERATION FOR DIRECTED GRAPH
    10.
    发明申请
    METHOD AND SYSTEM FOR RECURSION CHECK AND LOW-LEVEL CODE GENERATION FOR DIRECTED GRAPH 有权
    用于方向检查的方法和系统以及用于指导图的低级代码生成

    公开(公告)号：US20100153152A1

    公开(公告)日：2010-06-17

    申请号：US12336566

    申请日：2008-12-17

    申请人： Jaakob Kind

    发明人： Jaakob Kind

    IPC分类号： G06Q10/00 ,  G06T11/20

    CPC分类号： G06F17/30958 ,  G06Q10/0633 ,  G06Q10/0875

    摘要： A method and a system for fast recursion check and low-level code generation for directed graph. In a directed graph each vertex is connected to at least one other vertex with a directed edge to form an ordered pair of a source vertex and a target vertex. Low-level codes are assigned to the vertices of the directed graph, where for each ordered pair the low-level code of the target vertex is bigger than the low-level code of the source vertex. A new edge is added to connect a first vertex and a second vertex of the graph, where the first vertex is the source vertex and the second vertex is the target vertex of the new ordered pair. The low-level code of the target vertex of the new ordered pair is not bigger than the low-level code of the source vertex. For the new ordered pair and all ordered pairs that descend from the new ordered pair, the low-level codes of the target nodes are changed to values bigger than the low-level codes of the corresponding source vertices, when necessary.

    摘要翻译： 用于快速递归检查和有向图的低级代码生成的方法和系统。 在有向图中，每个顶点被连接到具有有向边的至少一个其他顶点以形成源顶点和目标顶点的有序对。 低级代码被分配给有向图的顶点，对于每个有序对，目标顶点的低级代码大于源顶点的低级代码。 添加一个新边来连接图的第一个顶点和第二个顶点，其中第一个顶点是源顶点，第二个顶点是新的有序对的目标顶点。 新有序对的目标顶点的低级代码不大于源顶点的低级代码。 对于新有序对和从新有序对下降的所有有序对，必要时，目标节点的低级代码被更改为大于相应源顶点的低级代码的值。