-
1.发明授权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
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过程包含过程友好的单元格，以及提高效率的推动模式，减少了正在进行的工作，并平滑了生产环境中的“摩擦”。 当前的应用程序提出了将作业分配给单元的最早完成时间策略和基于动态优先级的批量调度算法。
-
公开(公告)号：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
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.
-
公开(公告)号：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过程包括自动分割算法和/或最早的完成路由算法以生成操作调度。
-
4.发明授权System for adaptive lot sizing in cellular manufacturing for balancing workloads across multiple cells using split-then-merge operations and earliest completion route algorithm 有权使用分组合并操作和最早完成路径算法来平衡多个小区中的工作负载的蜂窝制造中的自适应批量大小的系统公开(公告)号：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过程包括自动分割算法和/或最早的完成路由算法以生成操作调度。
-
5.发明申请SYSTEM AND METHOD FOR MULTI-SITE CELLULAR MANUFACTURING WITH TRANSPORTATION DELAYS 审中-公开用于多地面细胞制造与运输延迟的系统和方法公开(公告)号：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: 系统和方法用于管理多站点打印店环境中的多个打印作业的调度。 多站点环境包括多个打印店，每个打印店具有完成至少一种类型的打印作业的资源和设备。 还包括多站点调度器配置，其被布置为将打印作业分配和调度到家庭商店和非家庭商店之一。 分配和调度基于最快的完成时间，其中家庭商店中的打印作业的完成时间被定义为完成打印作业所需的实际时间和非家庭商店中的打印作业的完成时间 被定义为完成打印作业和运输延迟所需的实际时间。
-
Patent Agency Ranking
6.发明申请SYSTEM AND METHODS FOR DYNAMIC SCHEDULING IN CELLULAR MANUFACTURING WITH BATCH-SPLITTING 有权用分割技术进行细胞生产的动态调度的系统和方法公开(公告)号：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过程包含过程友好的单元格，以及提高效率的推动模式，减少了正在进行的工作，并平滑了生产环境中的“摩擦”。 当前的应用程序提出了将作业分配给单元的最早完成时间策略和基于动态优先级的批量调度算法。
-
公开(公告)号：US08463416B2
公开(公告)日：2013-06-11
申请号：US12504063
申请日：2009-07-16
Applicant: Wheeler Ruml , Minh Binh Do , Rong Zhou
Inventor： Wheeler Ruml , Minh Binh Do , Rong Zhou
IPC: G06F19/00
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.
-
公开(公告)号：US20100010952A1
公开(公告)日：2010-01-14
申请号：US12409235
申请日：2009-03-23
Applicant: Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
Inventor： Lukas D. Kuhn , Tim Schmidt , Robert Price , Johan de Kleer , Rong Zhou , Minh Binh Do
IPC: G06N5/02
CPC classification number: G06Q10/04
Abstract: Target value search methods and systems are presented for solving a target value path problem to identify a path or paths in a graph in which a connection graph is created and upper and lower bound values are determined for each node in the connection graph, and a first best search is performed to identify a path or paths from a starting node to a goal node having a path value closest to the target value.
Abstract translation: 呈现目标价值搜索方法和系统，用于解决目标值路径问题，以识别其中创建连接图的图形中的路径或路径，并且为连接图中的每个节点确定上限值和下限值， 执行最佳搜索以识别从起始节点到具有最接近目标值的路径值的目标节点的路径或路径。
-
9.发明申请公开(公告)号：US20100010657A1
公开(公告)日：2010-01-14
申请号：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
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公式的配方，其中使用求解器来提供基于 至少部分地关于生产和诊断目标以及当前工厂条件，翻译组件将解决方案转化为工厂执行计划。
-
10.发明申请公开(公告)号：US20080300706A1
公开(公告)日：2008-12-04
申请号：US11807475
申请日：2007-05-29
Applicant: Wheeler Ruml , Minh Binh Do , Rong Zhou , Haitham Ali Hindi
Inventor： Wheeler Ruml , Minh Binh Do , Rong Zhou , Haitham Ali Hindi
IPC: G06F19/00
Abstract: Features described herein relate to optimizing a job plan procedure for selecting a plan for executing a manufacturing job. A planner can receive a model of a system that is to perform a job, and may select a precomputed plan that is sufficient to perform the job. The precomputed plan is identified during a first portion of a planning period, and the remainder of the planning period may be utilized to search for and identify a better plan for executing the job. If a better plan cannot be identified by the end of the planning period, then the selected precomputed plan can be executed.
Abstract translation: 本文描述的特征涉及优化用于选择用于执行制造作业的计划的作业计划过程。 计划员可以接收要执行作业的系统的模型，并且可以选择足以执行作业的预先计算的计划。 在计划期间的第一部分期间识别预先计算的计划，并且可以利用计划周期的其余部分来搜索和识别用于执行作业的更好的计划。 如果在规划期结束时无法确定更好的计划，则可以执行所选的预计算方案。
-
-
-
-
-
-
-
-
-
Search Results
44
records
(took 0.038 seconds)
