-
公开(公告)号：US06560501B1
公开(公告)日：2003-05-06
申请号：US09520669
申请日：2000-03-07
IPC分类号： G06F1900
CPC分类号： G06F9/4887 , G06Q10/04
摘要： A computer-based system (10) for aggregating and scheduling product batches (50) includes a batch aggregation engine (20) that allocates one or more product demands (40) to one or more product batches (50) having suggested sizes and suggested starting times. The batch aggregation engine (20) communicates to a scheduling engine (30) the suggested batch sizes, the suggested starting times, and feedback (26) relating to the suggested sizes and suggested starting times to assist the scheduling engine (30) in scheduling a start time for each product batch (50). The system (10) may also include a scheduling engine (30) coupled to the batch aggregation engine (20) that receives the suggested sizes, suggested starting times, and feedback (26) from the batch aggregation engine (20). The scheduling engine (30) schedules a starting time for one or more of the batches (50) according to the suggested sizes, suggested starting times, and feedback (26) received from the batch aggregation engine (20). The scheduling engine (30) also communicates the scheduled starting times and feedback (36) relating to the scheduled starting times to the batch aggregation engine (20) to assist the batch aggregation engine (20) in allocating the demands (40) to the batches (50). The batch aggregation engine (20) and the scheduling engine (30) may communicate their respective outputs (22, 32) to each other in an iterative cycle until they have collaboratively reached a sufficiently optimal batch aggregation and scheduling solution or until a predetermined number of iterations has been reached.
摘要翻译： 用于聚合和调度产品批次（50）的基于计算机的系统（10）包括批量聚合引擎（20），其将一个或多个产品需求（40）分配给具有建议尺寸的一个或多个产品批次（50） 次 批量聚合引擎（20）向调度引擎（30）通信建议的批量大小，建议的开始时间和与建议的大小和建议的开始时间有关的反馈（26），以辅助调度引擎（30）调度 每个产品批次的开始时间（50）。 系统（10）还可以包括耦合到批量聚合引擎（20）的调度引擎（30），其从批量聚合引擎（20）接收建议的大小，建议的开始时间和反馈（26）。 调度引擎（30）根据从批量聚合引擎（20）接收到的建议大小，建议起始时间和反馈（26）来安排一个或多个批次（50）的开始时间。 调度引擎（30）还将调度的开始时间和与调度的开始时间有关的反馈（36）传送到批量聚合引擎（20），以协助批量聚合引擎（20）将批量（40）分配给 （50）。 批量聚合引擎（20）和调度引擎（30）可以以迭代循环的方式将它们各自的输出（22,32）彼此通信，直到它们协作地达到足够优化的批量聚合和调度解决方案，或直到预定数量的 已经达成了迭代。
-
2.发明授权公开(公告)号：US06836689B2
公开(公告)日：2004-12-28
申请号：US10704080
申请日：2003-11-06
IPC分类号： G06F1900
CPC分类号： G06F9/4887 , G06Q10/04
摘要： In one aspect, a computer-implemented method is provided for aggregating and scheduling product batches in a manufacturing environment. Using a batch aggregation engine implementing a mathematical programming strategy, one or more product demands are allocated to one or more product batches having suggested sizes and suggested starting times. The mathematical programming strategy includes evaluating a number of time-based penalties relative to one another in allocating the demands to the batches, the time-based penalties being based on relationships between suggested starting times for batches and times of demands being considered for allocation to batches. The suggested sizes, the suggested starting times, and feedback relating to the suggested sizes and suggested starting times are communicated from the batch aggregation engine to a scheduling engine to assist the scheduling engine in scheduling starting times for the batches.
摘要翻译： 在一个方面，提供了一种计算机实现的方法，用于在制造环境中聚合和调度产品批次。 使用实现数学规划策略的批量聚合引擎，将一个或多个产品需求分配给具有建议尺寸和建议起始时间的一个或多个产品批次。 数学规划战略包括在分配对批次的需求时评估相对于彼此的基于时间的惩罚，基于时间的惩罚基于批次的建议开始时间与被分配给批次的需求时间之间的关系 。 建议的大小，建议的开始时间和与建议的大小和建议的开始时间相关的反馈从批量聚合引擎传送到调度引擎，以协助调度引擎调度批次的开始时间。
-
3.发明授权公开(公告)号：US07024265B2
公开(公告)日：2006-04-04
申请号：US11024299
申请日：2004-12-28
IPC分类号： G06F19/00
CPC分类号： G06F9/4887 , G06Q10/04
摘要： In one aspect, a computer-implemented method is provided for aggregating and scheduling product batches in a manufacturing environment. Using a batch aggregation engine implementing a mathematical programming strategy, one or more product demands are allocated to one or more product batches having suggested sizes and suggested starting times. The mathematical programming strategy includes evaluating a number of time-based penalties relative to one another in allocating the demands to the batches, the time-based penalties being based on relationships between suggested starting times for batches and times of demands being considered for allocation to batches. The suggested sizes, the suggested starting times, and feedback relating to the suggested sizes and suggested starting times are communicated from the batch aggregation engine to a scheduling engine to assist the scheduling engine in scheduling starting times for the batches.
摘要翻译： 在一个方面，提供了一种计算机实现的方法，用于在制造环境中聚合和调度产品批次。 使用实现数学规划策略的批量聚合引擎，将一个或多个产品需求分配给具有建议尺寸和建议起始时间的一个或多个产品批次。 数学规划策略包括在分配批次的需求时评估相对于彼此的基于时间的惩罚，基于时间的惩罚基于批次的建议开始时间与被分配给批次的需求时间之间的关系 。 建议的大小，建议的开始时间和与建议的大小和建议的开始时间相关的反馈从批量聚合引擎传送到调度引擎，以协助调度引擎调度批次的开始时间。
-
4.发明授权公开(公告)号：US06731998B2
公开(公告)日：2004-05-04
申请号：US10393793
申请日：2003-03-20
IPC分类号： G06F1900
CPC分类号： G06F9/4887 , G06Q10/04
摘要： In one embodiment, a method is provided for collaboratively solving an optimization problem using at least first optimization software and second optimization software each having at least partial information concerning the optimization problem. The method includes: (1) determining a solution to a first sub-problem of the optimization problem using the first optimization software based on the at least partial information concerning the optimization problem known to the first optimization software; (2) communicating from the first optimization software to the second optimization software the solution to the first sub-problem and information concerning one or more penalties for deviating from the solution to the first sub-problem; and (3) determining a solution to a second sub-problem using the second optimization software based on the at least partial information concerning the optimization problem known to the second optimization software, the communicated solution to the first sub-problem, and the communicated information concerning one or more penalties for deviating from the solution to the first sub-problem.
摘要翻译： 在一个实施例中，提供了一种用于使用至少第一优化软件和第二优化软件协同解决优化问题的方法，每个优化软件具有至少部分关于优化问题的信息。 该方法包括：（1）基于关于第一优化软件已知的优化问题的至少部分信息，使用第一优化软件确定优化问题的第一子问题的解; （2）从第一优化软件到第二优化软件对第一子问题的解决以及关于从解决方案偏离到第一子问题的一个或多个惩罚的信息; 以及（3）基于关于所述第二优化软件已知的优化问题的所述至少部分信息，所述第一子问题的通信解决方案和所传送的信息来确定使用所述第二优化软件的第二子问题的解 涉及一个或多个偏离解决方案到第一个子问题的处罚。
-
5.发明授权Computer implemented scheduling system and process using abstract local search technique 有权计算机实现调度系统和过程采用抽象局部搜索技术公开(公告)号：US06456996B1
公开(公告)日：2002-09-24
申请号：US09325937
申请日：1999-06-04
IPC分类号： G06F1730
CPC分类号： G06Q10/06 , Y10S707/99931
摘要： A method and system for solving constrained optimization problems. An initial abstract solution represents a prioritized set of decisions. The abstract solution is used as the basis for building a concrete solution. The concrete solution is analyzed to determine one or more local moves that represent a re-prioritization of the abstract solution. After a local moves is made, the process begins again with a new abstract solution, that is closer to an optimal solution. This process continues interactively until an optimal solution is reached or approached. The prioritized set of decisions can be implemented as a priority vector or a priority graph.
摘要翻译： 一种用于解决约束优化问题的方法和系统。 初始抽象解决方案代表了一组优先级的决策。 抽象解决方案被用作构建具体解决方案的基础。 分析具体解决方案以确定代表抽象解决方案的重新优先级的一个或多个局部移动。 在进行本地移动之后，该过程将再次以一个新的抽象解决方案开始，这更接近最优解。 此过程将交互式进行，直到达到或接近最佳解。 优先级决定的集合可以被实现为优先向量或优先级图。
-
公开(公告)号：US20210118052A1
公开(公告)日：2021-04-22
申请号：US17075598
申请日：2020-10-20
申请人： Joachim Paul Walser
发明人： Joachim Paul Walser
IPC分类号： G06Q40/04 , G06Q20/06 , G06Q20/10 , G06Q20/02 , G06Q20/36 , G06Q20/38 , G06Q40/02 , G06Q20/20 , G06Q10/10 , G06F9/54 , H04L9/14
摘要： The present invention concerns a cryptocurrency-cash gateway, comprising a wallet interface (403) for communicating over a network with at least one crypto wallet (102) and an EFT gateway interface (404) for communicating over a network with at least one electronic funds transfer, EFT, gateway or financial institution (407), wherein the cryptocurrency-cash gateway is operable to perform a cryptocurrency-to-cash transaction for allowing a user to withdraw cash at an automatic transaction machine, ATM (110), or a point-of-sale, POS, system (110B) by exchanging a corresponding amount of a cryptocurrency from the crypto wallet(s); or conversely allowing the user to deposit cash at an ATM or POS system and exchanging it for a corresponding amount of a cryptocurrency to be deposited in at least one crypto wallet of the user.
-
公开(公告)号：US08494887B2
公开(公告)日：2013-07-23
申请号：US10315282
申请日：2002-12-09
IPC分类号： G06Q10/00
CPC分类号： G06Q30/0206 , G06Q10/04 , G06Q10/063 , G06Q10/06375 , G06Q30/0202 , G06Q30/0205 , G06Q30/0283 , G06Q30/06
摘要： Generating an optimized pricing plan includes accessing a hierarchy comprising a sequence of levels, where each level includes an objective function and a set of constraints associated with the objective function. A mathematical programming model representing a pricing plan problem is determined for an item group comprising items. The following is repeated for each level of the sequence of levels: selecting a level comprising an objective function and a set of constraints associated with the objective function, determining an optimized boundary for the objective function, and adding a constraint generated from the optimized boundary to the set of constraints of a next level. An objective function of a last level of the sequence is optimized subject to the set of constraints associated with the objective function to yield an optimized result. An optimized pricing plan is generated in accordance with the optimized result.
-
-
-
-
-
-
搜索结果
7 条记录 (耗时 0.024 秒)
