公开(公告)号：US08200521B2

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

申请号：US11211842

申请日：2005-08-24

Applicant: Sven Hader

Inventor： Sven Hader

IPC: G06Q10/00

CPC classification number: G06Q10/06 ,  G06Q10/06312 ,  G06Q10/06315 ,  G06Q30/0204

Abstract: A system and method are described for identifying an appropriate demand distribution to use for safety stock planning within a supply chain management (“SCM”) system. For example, one embodiment of the invention comprises a computer-implemented method comprising: extracting historical demand characteristics for a product from a specified data source, the demand characteristics including the mean value of the demand for specified periods of time and/or the fraction of periods without any demand; evaluating the historical demand characteristics including the mean value of the demand for the specified periods and/or the fraction of periods without any demand; based on the evaluation, categorizing the demand characteristics into one of two or more different predefined categories; and using the classification to perform safety stock calculations for the product over the specified periods of time.

Abstract translation: 描述了一种用于识别在供应链管理（“SCM”）系统中用于安全库存计划的适当需求分配的系统和方法。 例如，本发明的一个实施例包括一种计算机实现的方法，包括：从指定的数据源中提取产品的历史需求特征，所述需求特征包括特定时间段的需求的平均值和/或 没有任何需求的时期 评估历史需求特征，包括指定期间需求的平均值和/或没有任何需求的期间分数; 基于评估，将需求特征分类为两个或更多个不同的预定类别之一; 并使用分类在特定时间段内执行产品的安全库存计算。

公开(公告)号：US07996330B2

公开(公告)日：2011-08-09

申请号：US10900995

申请日：2004-07-28

Applicant: Thomas Veit ,  Ines Wannemacher ,  Susanne Ziehl ,  Thomas Roth ,  Ruediger Zuerl

Inventor： Thomas Veit ,  Ines Wannemacher ,  Susanne Ziehl ,  Thomas Roth ,  Ruediger Zuerl

IPC: G06Q99/00

CPC classification number: G06Q30/02 ,  G06Q30/0202 ,  G06Q30/0211 ,  G06Q30/0283 ,  G06Q30/0601

Abstract: The present invention discloses a method, program product and system for controlling pricing of a product or service using a markdown profile. The method includes: selecting a markdown profile to be used for the product or service, selecting a retail price for the product or service, acquiring updated sales data regarding the product or service, determining a markdown to be applied to the price from the markdown profile using updated sales data, and reconciling a markdown budget with the determined markdown to be applied to said price to determine whether the markdown will be applied. The method can further include the step of adjusting a retail price of the product or service by the markdown.

Abstract translation: 本发明公开了一种使用降价简档来控制产品或服务定价的方法，程序产品和系统。 该方法包括：选择要用于产品或服务的降价简档，选择产品或服务的零售价格，获取关于产品或服务的更新的销售数据，从降价简档确定应用于价格的降价 使用更新的销售数据，以及将降价预算与确定的降价进行调节以应用于所述价格，以确定是否应用降价。 该方法还可以包括通过降价调整产品或服务的零售价格的步骤。

公开(公告)号：US08655855B2

公开(公告)日：2014-02-18

申请号：US11298444

申请日：2005-12-09

Applicant: Thomas Christ ,  Thomas Griesser ,  Bernhard Hauser ,  Tobias Gutwein ,  Harald Breitling ,  Daniel Tschoeke

Inventor： Thomas Christ ,  Thomas Griesser ,  Bernhard Hauser ,  Tobias Gutwein ,  Harald Breitling ,  Daniel Tschoeke

IPC: G06F7/00 ,  G06F17/00

CPC classification number: G06Q10/087 ,  G06Q10/06

Abstract: Methods and apparatus provide a delay in posting a confirmation of a warehouse activity in a warehouse having decentralized management. The delay enables a process to be performed with respect to the goods associated with the confirmation. For example, the delay can enable a CRM system to route the goods to fulfill an order for goods. In another example, the delay can enable the performance of a correction to the confirmation of the goods.

Abstract translation: 方法和装置延迟在具有分散管理的仓库中发布仓库活动的确认。 该延迟使得能够针对与确认相关联的商品执行处理。 例如，延迟可以使CRM系统能够路由货物以完成商品订单。 在另一个示例中，延迟可以使得能够对货物的确认执行更正。

公开(公告)号：US08332810B2

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

申请号：US12276602

申请日：2008-11-24

Applicant: Klaus Steinbach

Inventor： Klaus Steinbach

IPC: G06F9/44

CPC classification number: G06F8/4441

Abstract: A set order that most efficiently separates a set of output vectors of a derivation table is iteratively determined for a set of input vectors belonging to the derivation table. Code is generated to evaluate the input vectors in the set order.

Abstract translation: 对于属于派生表的一组输入向量，迭代地确定最有效地分离导出表的一组输出向量的集合顺序。 生成代码以按照设置的顺序来评估输入向量。

公开(公告)号：US08301476B2

公开(公告)日：2012-10-30

申请号：US12096360

申请日：2005-12-05

Applicant: Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

Inventor： Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

IPC: G06Q10/00

CPC classification number: G06Q10/06315 ,  G06Q10/06

Abstract: The invention provides methods and apparatus, including computer program products, for of determining a possible lot size of units with respect to a fixed date for a chain of at least two process steps, each process step requiring a respective assigned resource, and consuming a respective time per unit for being performed by the respective assigned resource, where the process steps are sequentially dependent on each other. This is achieved by the following: (a) determining, for each resource, a respective time interval of availability during which the respective resource is continuously available, each time interval being limited by the fixed date, (b) calculating, for each determined time interval of availability, a respective largest possible number of times the respective process step can be performed by the respective resource, and (c) selecting the lot size of units to the minimum of the largest possible numbers.

Abstract translation: 本发明提供了包括计算机程序产品的方法和装置，用于确定关于至少两个处理步骤的链的固定日期的单元的可能批量大小，每个处理步骤需要相应的分配的资源，并且消耗相应的 每个单位的时间由相应的分配资源执行，其中处理步骤依次依赖于彼此。 这通过以下方式实现：（a）为每个资源确定相应资源持续可用的相应可用时间间隔，每个时间间隔被固定日期限制，（b）对于每个确定的时间计算 可用性的间隔，相应资源可以执行各个处理步骤的相应最大可能次数，以及（c）将单元的批量大小选择为最大可能数量的最小值。

公开(公告)号：US08244645B2

公开(公告)日：2012-08-14

申请号：US11212317

申请日：2005-08-25

Applicant: Konstantin N. Malitski

Inventor： Konstantin N. Malitski

IPC: G06Q30/00

CPC classification number: G06Q10/04 ,  G06Q10/08 ,  G06Q10/083 ,  G06Q10/0833 ,  G06Q50/28

Abstract: A new model for transportation planning vehicle scheduling (TPVS). A database table for shipment documents independent of an order for goods, e.g., a sales order is created. When an order for goods is received, the database table is populated with a shipment document corresponding to, but independent of, the order for goods. This shipment document is owned by the TPVS system.

Abstract translation: 运输规划车辆调度（TPVS）的新模式。 创建独立于商品订单（例如销售订单）的装运单据的数据库表。 当收到货物订单时，数据库表中填有与货物订单相对应但与之无关的装运单据。 该装运单据由TPVS系统拥有。

公开(公告)号：US08090746B2

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

申请号：US11998683

申请日：2007-11-29

Applicant: Peter Vignet

Inventor： Peter Vignet

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30371

Abstract: A system and method are described for maintaining consistent table behavior when in different modes of operation. For example, a computer-implemented method according to one embodiment of the invention comprises: generating a table containing a selection column comprised of selectable cells, the table having a current lead selected row; providing a user with the option to select between an editable mode and a read only mode for the table, wherein, when in the editable mode the user is permitted to edit one or more cells within the table; detecting user input in relation to the table, wherein: if the user selects an editable cell when in the editable mode, allowing the user to edit the contents of the cell without changing the lead selected row; if the user selects a cell in read only mode, maintaining the current lead selected row; and changing to a new lead selected row in both the editable mode and the read only mode only if the user selects the new lead selected row from a cell within the selection column.

Abstract translation: 描述了一种系统和方法，用于在不同的操作模式下维护一致的表行为。 例如，根据本发明的一个实施例的计算机实现的方法包括：生成包含由可选单元组成的选择列的表，该表具有当前引线选择行; 向用户提供在表的可编辑模式和只读模式之间进行选择的选项，其中，当处于可编辑模式时，允许用户编辑表内的一个或多个单元; 检测与所述表相关的用户输入，其中：如果所述用户在所述可编辑模式中选择可编辑单元，则允许所述用户编辑所述单元的内容而不改变所述引导选择行; 如果用户以只读模式选择单元，则保持当前引线所选行; 并且只有当用户从选择列中的单元格中选择新的引线选择行时，才可以在可编辑模式和只读模式下切换到新的引导选择行。

公开(公告)号：US08799293B2

公开(公告)日：2014-08-05

申请号：US11250990

申请日：2005-10-13

Applicant: Harald Breitling

Inventor： Harald Breitling

IPC: G06F7/00 ,  G06F17/30 ,  G06Q10/08 ,  G06Q10/00

CPC classification number: G06Q10/08 ,  G06Q10/087

Abstract: A system and method to improve storage efficiency in a warehouse. Storage combinations are assigned a ranking base on the distance from optimal storage. After sorting the data structure base on the ranking a best available storage combination can be identified by iterating the table in a rank order. In one embodiment, the ranking is used to identify candidates for rearrangement. By comparing the best available ranking with the current ranking, greater differences reflect greater benefit of rearrangement.

Abstract translation: 一种提高仓库存储效率的系统和方法。 根据最佳存储距离分配存储组合的排名。 在基于排名的数据结构排序之后，可以通过以等级顺序迭代表来识别最佳可用存储组合。 在一个实施例中，排名用于识别用于重排的候选。 通过将最佳可用排名与当前排名进行比较，更大的差异反映了重排的更大好处。

公开(公告)号：US08417549B2

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

申请号：US11139303

申请日：2005-05-27

Applicant: Ravi Rakesh ,  Stefan Merker ,  Juergen Koenemann ,  Stefan Resag ,  Jochen Steinbach

Inventor： Ravi Rakesh ,  Stefan Merker ,  Juergen Koenemann ,  Stefan Resag ,  Jochen Steinbach

IPC: G06Q10/00

CPC classification number: G06Q10/06 ,  G06Q10/06314 ,  G06Q10/06315 ,  G06Q30/0202

Abstract: A system and method are described for intelligently sourcing demand forecasts within a supply chain management (“SCM”) system based on a constrained supply chain model, in light of material and resource constraints. For example, a computer implemented method according to one embodiment of the invention comprises: calculating a demand forecast identifying anticipated demand for a product over a specified time period; identifying current sales orders for the product with delivery dates scheduled during the specified time period; generating an open forecast for the product based on the current sales orders and the anticipated demand; and sourcing different percentages of the open forecast from different plants, the percentages selected based on supply chain material and/or resource constraints. In addition, after the demand forecast is sourced, one embodiment of the invention employs additional techniques for intelligently sourcing new sales orders entering the SCM system.

Abstract translation: 描述了一种系统和方法，用于根据材料和资源限制，在供应链管理（SCM）系统中智能采购基于受限供应链模型的需求预测。 例如，根据本发明的一个实施例的计算机实现的方法包括：计算在特定时间段内识别产品的预期需求的需求预测; 确定在指定时间段内安排交货日期的产品的当前销售订单; 根据目前的销售订单和预期需求，产生对产品的公开预测; 并采购不同工厂的不同百分比的开放预测，根据供应链材料和/或资源限制选择的百分比。 此外，在需求预测来源之后，本发明的一个实施例采用额外的技术来智能地采购进入SCM系统的新销售订单。

公开(公告)号：US08352516B2

公开(公告)日：2013-01-08

申请号：US11390614

申请日：2006-03-27

Applicant: Wolfgang E. Walter ,  Amar Kumar

Inventor： Wolfgang E. Walter ,  Amar Kumar

IPC: G06F17/30

CPC classification number: G06F17/3056

Abstract: Methods and apparatuses enable a generic mapping tool accessible to multiple applications. One or more of the applications may invoke the mapping tool to map objects to each other with a defined relationship. The mapping occurs dynamically during the run-time of the application. The flexibility of the mapping tool enables the use of standard mapping mechanisms.

Abstract translation: 方法和装置使得通用的映射工具可以被多个应用程序访问。 一个或多个应用程序可以调用映射工具，以定义的关系将对象映射到彼此。 映射在应用程序的运行时间内动态发生。 映射工具的灵活性使得能够使用标准的映射机制。