公开(公告)号：US08464268B2

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

申请号：US12558879

申请日：2009-09-14

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

IPC: G06F17/00

CPC classification number: G06Q10/00 ,  G05B19/41865 ,  G05B2219/32056 ,  G05B2219/45187 ,  Y02P90/20

Abstract: 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.

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

公开(公告)号：US20120099139A1

公开(公告)日：2012-04-26

申请号：US12911766

申请日：2010-10-26

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

IPC: G06F15/00

CPC classification number: G06F3/1211 ,  G06F3/1241 ,  G06F3/126 ,  G06F3/1285 ,  G06F2206/1508 ,  G06F2206/1514

Abstract: The present application presents a new and improved system and method of enhanced Lean Document Production (LDP), which employs cellular manufacturing concepts. The LDP process incorporates an auto-splitting algorithm and/or an earliest completion route algorithm to generate an operation schedule.

Abstract translation: 本应用提出了一种新的改进的系统和方法，该系统和方法采用了细胞制造概念。 LDP过程包括自动分割算法和/或最早的完成路由算法以生成操作调度。

公开(公告)号：US10732913B2

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

申请号：US13156573

申请日：2011-06-09

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do ,  Craig Lambrecht

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do ,  Craig Lambrecht

IPC: G06F3/12 ,  G06Q10/06 ,  H04N1/32

Abstract: A system and method is used to manage scheduling of a plurality of print jobs in a multi-site print shop environment. The multi-site environment includes a plurality of print shops each having resources and equipment to complete at least one type of print job. Also included is a multi-site scheduler configuration arranged to assign and schedule print jobs to one of a home shop and a non-home shop. The assigning and scheduling is based on a fastest completion time, wherein a completion time of a print job in a home shop is defined as the actual time taken to complete the print job and a completion time of a print job in a non-home shop is defined as the actual time taken to complete the print job and a transportation delay.

公开(公告)号：US08769542B2

公开(公告)日：2014-07-01

申请号：US12911766

申请日：2010-10-26

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

IPC: G06F15/00

CPC classification number: G06F3/1211 ,  G06F3/1241 ,  G06F3/126 ,  G06F3/1285 ,  G06F2206/1508 ,  G06F2206/1514

Abstract: The present application presents a new and improved system and method of enhanced Lean Document Production (LDP), which employs cellular manufacturing concepts. The LDP process incorporates an auto-splitting algorithm and/or an earliest completion route algorithm to generate an operation schedule.

Abstract translation: 本应用提出了一种新的改进的系统和方法，该系统和方法采用了细胞制造概念。 LDP过程包括自动分割算法和/或最早的完成路由算法以生成操作调度。

公开(公告)号：US20120314248A1

公开(公告)日：2012-12-13

申请号：US13156573

申请日：2011-06-09

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do ,  Craig Lambrecht

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do ,  Craig Lambrecht

IPC: G06K15/00

Abstract: A system and method is used to manage scheduling of a plurality of print jobs in a multi-site print shop environment. The multi-site environment includes a plurality of print shops each having resources and equipment to complete at least one type of print job. Also included is a multi-site scheduler configuration arranged to assign and schedule print jobs to one of a home shop and a non-home shop. The assigning and scheduling is based on a fastest completion time, wherein a completion time of a print job in a home shop is defined as the actual time taken to complete the print job and a completion time of a print job in a non-home shop is defined as the actual time taken to complete the print job and a transportation delay.

Abstract translation: 系统和方法用于管理多站点打印店环境中的多个打印作业的调度。 多站点环境包括多个打印店，每个打印店具有完成至少一种类型的打印作业的资源和设备。 还包括多站点调度器配置，其被布置为将打印作业分配和调度到家庭商店和非家庭商店之一。 分配和调度基于最快的完成时间，其中家庭商店中的打印作业的完成时间被定义为完成打印作业所需的实际时间和非家庭商店中的打印作业的完成时间 被定义为完成打印作业和运输延迟所需的实际时间。

公开(公告)号：US20110066269A1

公开(公告)日：2011-03-17

申请号：US12558879

申请日：2009-09-14

Applicant: Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

Inventor： Rong Zhou ,  Sudhendu Rai ,  Minh Binh Do

IPC: G06F17/00

CPC classification number: G06Q10/00 ,  G05B19/41865 ,  G05B2219/32056 ,  G05B2219/45187 ,  Y02P90/20

Abstract: 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.

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

公开(公告)号：US10410144B2

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

申请号：US13273714

申请日：2011-10-14

Applicant: Rong Zhou ,  Minh Binh Do ,  Tim C. Schmidt ,  Serdar Uckun

Inventor： Rong Zhou ,  Minh Binh Do ,  Tim C. Schmidt ,  Serdar Uckun

IPC: G06Q10/04

Abstract: 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.

公开(公告)号：US20130097199A1

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

申请号：US13273714

申请日：2011-10-14

Applicant: Rong Zhou ,  Minh Binh Do ,  Tim C. Schmidt ,  Serdar Uckun

Inventor： Rong Zhou ,  Minh Binh Do ,  Tim C. Schmidt ,  Serdar Uckun

IPC: G06F17/30

CPC classification number: G06Q10/04

Abstract: 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.

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

公开(公告)号：US08145334B2

公开(公告)日：2012-03-27

申请号：US12364006

申请日：2009-02-02

Applicant: Minh Binh Do ,  Hector Luis Palacios Verdes ,  Rong Zhou ,  Lukas Daniel Kuhn ,  Johan de Kleer

Inventor： Minh Binh Do ,  Hector Luis Palacios Verdes ,  Rong Zhou ,  Lukas Daniel Kuhn ,  Johan de Kleer

IPC: G06F19/00 ,  G06F15/00 ,  G05B13/02

CPC classification number: G06Q10/06 ,  Y02P90/86 ,  Y10S706/906 ,  Y10S706/912 ,  Y10S706/914

Abstract: A control systems and methods are presented for controlling a production system, in which a model-based planner includes a formulation, such as a SAT formulation representing possible actions in the production, with a solver being used to provide a solution to the formulation based at least partially on production and diagnostic goals and the current plant condition, and a translation component translates the solution into a plan for execution in the plant.

Abstract translation: 提出了一种用于控制生产系统的控制系统和方法，其中基于模型的计划者包括诸如表示生产中的可能动作的SAT公式的配方，其中使用求解器来提供基于 至少部分地关于生产和诊断目标以及当前工厂条件，翻译组件将解决方案转化为工厂执行计划。

公开(公告)号：US20090268247A1

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

申请号：US12504063

申请日：2009-07-16

Applicant: Wheeler Ruml ,  Minh Binh Do ,  Rong Zhou

Inventor： Wheeler Ruml ,  Minh Binh Do ,  Rong Zhou

IPC: G06F3/12

CPC classification number: G06F3/1214 ,  G03G15/5083 ,  G03G2215/00113 ,  G03G2215/00126 ,  G06F3/1215 ,  G06F3/124 ,  G06F3/126 ,  G06F3/1263 ,  G06F3/1285 ,  G06Q10/06

Abstract: 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.

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