公开(公告)号：US20090019446A1

公开(公告)日：2009-01-15

申请号：US12096360

申请日：2005-12-05

申请人： Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

发明人： Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

IPC分类号： G06F9/50

CPC分类号： G06Q10/06315 ,  G06Q10/06

摘要： 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.

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

公开(公告)号：US08301476B2

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

申请号：US12096360

申请日：2005-12-05

申请人： Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

发明人： Heinrich Braun ,  Markus Riepp ,  Thomas Dehoust

IPC分类号： G06Q10/00

CPC分类号： G06Q10/06315 ,  G06Q10/06

摘要： 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.

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