Using buffers to support uncertainties in marking engine execution
    1.
    发明授权
    Using buffers to support uncertainties in marking engine execution 有权
    使用缓冲区来支持标记引擎执行的不确定性

    公开(公告)号:US08169626B2

    公开(公告)日:2012-05-01

    申请号:US12201377

    申请日:2008-08-29

    IPC分类号: G06K15/00 H04N1/32 H04N1/04

    摘要: A printing system includes at least one marking engine and a paper path which carries sheets of print media to the marking engine from an upstream direction and carries sheets of print media which have been marked by the marking engine in a downstream direction. A buffer system includes a sheet buffer in the paper path downstream of the marking engine and optionally includes another sheet buffer in the paper path upstream of the marking engine. The buffer system allows variability in the residence time of the marking engine to be accommodated by varying the residence time of sheets in the downstream buffer.

    摘要翻译: 打印系统包括至少一个标记引擎和从上游方向将打印介质携带打印介质的纸张路径,并且在下游方向上承载已经由标记引擎标记的打印介质的纸张。 缓冲系统包括在标记引擎下游的纸路径中的纸张缓冲器,并且可选地在标记引擎的上游的纸路中包括另一纸张缓冲器。 缓冲系统通过改变片材在下游缓冲器中的停留时间来允许标记引擎的停留时间的变化。

    USING BUFFERS TO SUPPORT UNCERTAINTIES IN MARKING ENGINE EXECUTION
    2.
    发明申请
    USING BUFFERS TO SUPPORT UNCERTAINTIES IN MARKING ENGINE EXECUTION 有权
    使用缓冲区来支持标记引擎执行中的不确定性

    公开(公告)号:US20100053641A1

    公开(公告)日:2010-03-04

    申请号:US12201377

    申请日:2008-08-29

    IPC分类号: G06F3/12

    摘要: A printing system includes at least one marking engine and a paper path which carries sheets of print media to the marking engine from an upstream direction and carries sheets of print media which have been marked by the marking engine in a downstream direction. A buffer system includes a sheet buffer in the paper path downstream of the marking engine and optionally includes another sheet buffer in the paper path upstream of the marking engine. The buffer system allows variability in the residence time of the marking engine to be accommodated by varying the residence time of sheets in the downstream buffer.

    摘要翻译: 打印系统包括至少一个标记引擎和从上游方向将打印介质携带打印介质的纸张路径,并沿着下游方向携带由标记引擎标记的打印介质的纸张。 缓冲系统包括在标记引擎下游的纸路径中的纸张缓冲器,并且可选地在标记引擎的上游的纸路中包括另一纸张缓冲器。 缓冲系统通过改变片材在下游缓冲器中的停留时间来允许标记引擎的停留时间的变化。

    System and method for parallel edge partitioning in and/or graph search

    公开(公告)号:US10410144B2

    公开(公告)日:2019-09-10

    申请号:US13273714

    申请日:2011-10-14

    IPC分类号: G06Q10/04

    摘要: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes. The method progresses to the next search layer once all the adjusted operator groups in the current search layer have been used for node expansions.

    Dynamic scheduling of jobs/batches using earliest completion time algorithm in cellular manufacturing with batch-splitting of jobs above certain size
    4.
    发明授权
    Dynamic scheduling of jobs/batches using earliest completion time algorithm in cellular manufacturing with batch-splitting of jobs above certain size 有权
    使用最早完成时间算法的动态调度作业/批次,在具有特定大小的作业中进行批量分割的蜂窝制造

    公开(公告)号:US08464268B2

    公开(公告)日:2013-06-11

    申请号:US12558879

    申请日:2009-09-14

    IPC分类号: G06F17/00

    摘要: The present application a new and improved system and method of enhanced Lean Document Production (LDP), which applies cellular manufacturing to document printing operations. The LDP process incorporates process friendly cells and, a push model to order to improve efficiency, reduce work in progress and smooth out the “frictions” in production environments. The current application presents an earliest-completion-time strategy for assigning jobs to cells and a dynamic-priority-based-batch-scheduling algorithm.

    摘要翻译: 本申请提出了一种新的改进的精益文件生产(LDP)系统和方法,该系统和方法将细胞制造应用于文件印刷操作。 LDP过程包含过程友好的单元格,以及提高效率的推动模式,减少了正在进行的工作,并平滑了生产环境中的“摩擦”。 当前的应用程序提出了将作业分配给单元的最早完成时间策略和基于动态优先级的批量调度算法。

    System and method for parallel edge partitioning in and/or graph search
    5.
    发明申请
    System and method for parallel edge partitioning in and/or graph search 审中-公开
    和/或图形搜索中的并行边缘划分的系统和方法

    公开(公告)号:US20130097199A1

    公开(公告)日:2013-04-18

    申请号:US13273714

    申请日:2011-10-14

    IPC分类号: G06F17/30

    CPC分类号: G06Q10/04

    摘要: A method and system for searching a graph in parallel which constructs an abstract representation of an AND/OR graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups adjusted for AND node outcomes. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning, wherein the abstract edges are used to define the smaller duplicate detection scopes. Nodes in the current search layer are expanded by a processing unit using the adjusted operator groups of outgoing abstract edges of the abstract nodes mapped into by the nodes, wherein the nodes expanded in parallel use adjusted operator groups associated with abstract edges having disjoint duplicate detection scopes. The method progresses to the next search layer once all the adjusted operator groups in the current search layer have been used for node expansions.

    摘要翻译: 用于并行搜索图形的方法和系统,其使用状态空间抽象来构造AND / OR图的抽象表示。 图的抽象表示包括具有重复检测范围的一个或多个抽象节点和具有针对AND节点结果调整的运算符组的一个或多个抽象边缘。 使用边缘分割将抽象节点的重复检测范围划分为较小的重复检测范围,其中抽象边缘用于定义较小的重复检测范围。 当前搜索层中的节点由处理单元使用由节点映射的抽象节点的输出抽象边缘的经调整的运算符组进行扩展,其中并行扩展的节点使用与具有不相交的重复检测范围的抽象边缘相关联的调整的运算符组 。 一旦当前搜索图层中所有已调整的运算符组已被用于节点扩展,该方法将进行到下一个搜索层。

    SYSTEM AND METHOD FOR ON-LINE PLANNING UTILIZING MULTIPLE PLANNING QUEUES
    7.
    发明申请
    SYSTEM AND METHOD FOR ON-LINE PLANNING UTILIZING MULTIPLE PLANNING QUEUES 有权
    使用多个规划队列进行在线规划的系统和方法

    公开(公告)号:US20090268247A1

    公开(公告)日:2009-10-29

    申请号:US12504063

    申请日:2009-07-16

    IPC分类号: G06F3/12

    摘要: Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy.

    摘要翻译: 本文描述的特征涉及使用多个作业计划队列同时处理对一个或多个机器和/或其组件的多个作业请求批次。 每批作业请求被分配给规划队列,并且每个规划队列包括存储非计划作业的未计划子队列,存储等待执行的计划作业的未发送子队列和存储已经被输出到的计划作业的发送子队列 执行机器。 作业计划器和相关组件确定在给定时间点哪个未发送的子队列具有最少的计划作业,并从与所标识的未发送子队列相同的计划队列中的计划外子队列中选择一个计划外作业。 然后,计划人员将为所选作业生成计划,并将计划的作业插入到未发送的子队列中,以最终输出到机器执行。 以这种方式,用于每个规划队列的未发送子队列被保持具有基本上相等数量的准备执行的计划作业,这通过确保所有机器和/或相关组件保持繁忙而提高了吞吐量。

    System and method for on-line planning utilizing multiple planning queues
    8.
    发明授权
    System and method for on-line planning utilizing multiple planning queues 失效
    使用多个规划队列进行在线规划的系统和方法

    公开(公告)号:US07590464B2

    公开(公告)日:2009-09-15

    申请号:US11807472

    申请日:2007-05-29

    IPC分类号: G06F19/00

    摘要: Features described herein relate to concurrently processing multiple batches of job requests for one or more machines and/or components thereof, using a plurality of job planning queues. Each batch of job requests is allocated to a planning queue, and each planning queue comprises an unplanned subqueue that stores unplanned jobs, an unsent subqueue that stores planned jobs waiting to be executed, and a sent subqueue that stores planned jobs that have been output to the machine(s) for execution. A job planner and related components determine which unsent subqueue has the fewest planned jobs at a given point in time, and selects an unplanned job from the unplanned subqueue in the same planning queue as the identified unsent subqueue. The planner then generates a plan for the selected job and inserts the planned job into the unsent subqueue for eventual output to the machine(s) for execution. In this manner, the unsent subqueues for each planning queue are maintained with substantially equal numbers of planned jobs ready for execution, which improves throughput by ensuring that all machines and/or associated components are kept busy.

    摘要翻译: 本文描述的特征涉及使用多个作业计划队列同时处理对一个或多个机器和/或其组件的多个作业请求批次。 每批作业请求被分配给规划队列,并且每个规划队列包括存储非计划作业的未计划子队列,存储等待执行的计划作业的未发送子队列和存储已经被输出到的计划作业的发送子队列 执行机器。 作业计划器和相关组件确定在给定时间点哪个未发送的子队列具有最少的计划作业,并从与所标识的未发送子队列相同的计划队列中的计划外子队列中选择一个计划外作业。 然后,计划人员将为所选作业生成计划,并将计划的作业插入到未发送的子队列中,以最终输出到机器执行。 以这种方式,用于每个规划队列的未发送子队列被保持具有基本上相等数量的准备执行的计划作业,这通过确保所有机器和/或相关组件保持繁忙而提高了吞吐量。