公开(公告)号：US20050228521A1

公开(公告)日：2005-10-13

申请号：US11099626

申请日：2005-04-06

申请人： Tazu Nomoto ,  Mitsuhiro Enomoto ,  Masayuki Toda ,  Mitsunobu Nakamura

发明人： Tazu Nomoto ,  Mitsuhiro Enomoto ,  Masayuki Toda ,  Mitsunobu Nakamura

IPC分类号： G05B19/418 ,  G06F19/00 ,  G06Q50/00 ,  G06Q50/04

CPC分类号： G06Q10/04 ,  Y02P90/20

摘要： The invention proposes a method for devising a production plan of a product to be produced through multiple production steps having different characteristics in a supply chain across multiple companies and/or multiple factories. The method divides a production step of the product into multiple production steps in advance based on a constraint to be considered when the production plan therefor is devised, defines identifiers for the multiple production steps, prestores the defined identifiers in a storage portion as step identification information, and prestores step information having at least correspondences between the production steps and items. In this case, a calculation processing portion identifies and determines production steps and order of calculations, which are involved in the production of the product, based on the shipping plan information, parts table and step information stored in the storage portion, determines which of first and second production plan calculation algorithms is to be executed based on the order of calculations and based on the step identification information stored for each production step, and calculates the production plan by using the determined algorithm.

摘要翻译： 本发明提出了一种通过在多个公司和/或多个工厂的供应链中具有不同特征的多个生产步骤来设计要生产的产品的生产计划的方法。 该方法基于在设计生产计划时要考虑的约束，将产品的生产步骤预先分为多个生产步骤，定义多个生产步骤的标识符，将存储部分中定义的标识符预先存储为步骤识别信息 ，以及具有至少对应于生产步骤和项目之间的预先步骤信息。 在这种情况下，计算处理部基于存储在存储部中的运送计划信息，部件表和步骤信息来识别并确定涉及产品生产的生产步骤和计算顺序，确定第一 并且基于计算顺序并且基于针对每个生产步骤存储的步骤识别信息来执行第二生产计划计算算法，并且通过使用所确定的算法来计算生产计划。

公开(公告)号：US20100057238A1

公开(公告)日：2010-03-04

申请号：US12533547

申请日：2009-07-31

申请人： Tazu NOMOTO ,  Ken IGARASHI ,  Katsunari IKEZAWA ,  Takaaki KOMURA

发明人： Tazu NOMOTO ,  Ken IGARASHI ,  Katsunari IKEZAWA ,  Takaaki KOMURA

IPC分类号： G06F19/00

CPC分类号： G06Q10/087

摘要： The present invention is directed to a technique to easily establish a supply plan which optimizes multiple evaluation indexes on the basis of the priorities of the multiple evaluation indexes. When the number of evaluation indexes stored in the evaluation index storage area is larger than a predetermined threshold, a processing is repeated for specifying two evaluation indexes from those stored in the evaluation index storage area, and synthesizing the specified evaluation indexes by using a weighing factor, until the number of evaluation indexes becomes equal to or less than the threshold.

摘要翻译： 本发明涉及一种容易地建立基于多个评价指标的优先级优化多个评价指标的供给方案的技术。 当存储在评估指标存储区域中的评价指标的数量大于预定阈值时，重复从存储在评价指标存储区域中的两个评价指标进行指定的处理，并且通过使用加权因子来合成指定的评价指标 ，直到评价指标的数量等于或小于阈值。

公开(公告)号：US07444294B2

公开(公告)日：2008-10-28

申请号：US09738325

申请日：2000-12-18

申请人： Tazu Nomoto ,  Sachiko Iwamoto ,  Mitsuhiro Enomoto ,  Katsunari Ikezawa

发明人： Tazu Nomoto ,  Sachiko Iwamoto ,  Mitsuhiro Enomoto ,  Katsunari Ikezawa

IPC分类号： G06F17/50

CPC分类号： G06Q10/06 ,  G06Q10/0631 ,  G06Q10/06375 ,  G06Q30/02 ,  G06Q30/0202 ,  Y02P90/20

摘要： For planning a production plan which satisfies a plural number of target values of management indices, upon calculating out production amount, supply amount and/or transportation means of plural products, various kinds of target values of management indices and estrangement values thereof are set into restriction conditions when those restriction conditions are formulated into a linear programming problem, and then feasible production plan is calculated out, so that the estrangement between the management indices being calculated from executable solutions of the above-mentioned linear programming problems and the target values thereof comes to be minimal.

摘要翻译： 为了规划满足多个目标管理指标值的生产计划，在计算多个产品的生产量，供给量和/或运输工具时，将各种管理指标和异常值的目标值设定为限制 将这些限制条件制定成线性规划问题的条件，然后计算出可行的生产计划，以便从上述线性规划问题的可执行解决方案和其目标值计算出的管理指标之间的差异来到 最小

公开(公告)号：US07092775B2

公开(公告)日：2006-08-15

申请号：US11099626

申请日：2005-04-06

申请人： Tazu Nomoto ,  Mitsuhiro Enomoto ,  Masayuki Toda ,  Mitsunobu Nakamura

发明人： Tazu Nomoto ,  Mitsuhiro Enomoto ,  Masayuki Toda ,  Mitsunobu Nakamura

IPC分类号： G06F19/00

CPC分类号： G06Q10/04 ,  Y02P90/20

摘要： The invention proposes a method for devising a production plan of a product to be produced through multiple production steps having different characteristics in a supply chain across multiple companies and/or multiple factories. The method divides a production step of the product into multiple production steps in advance based on a constraint to be considered when the production plan therefor is devised, defines identifiers for the multiple production steps, prestores the defined identifiers in a storage portion as step identification information, and prestores step information having at least correspondences between the production steps and items. In this case, a calculation processing portion identifies and determines production steps and order of calculations, which are involved in the production of the product, based on the shipping plan information, parts table and step information stored in the storage portion, determines which of first and second production plan calculation algorithms is to be executed based on the order of calculations and based on the step identification information stored for each production step, and calculates the production plan by using the determined algorithm.

摘要翻译： 本发明提出了一种通过在多个公司和/或多个工厂的供应链中具有不同特征的多个生产步骤来设计要生产的产品的生产计划的方法。 该方法基于在设计生产计划时要考虑的约束，将产品的生产步骤预先分为多个生产步骤，定义多个生产步骤的标识符，将存储部分中定义的标识符预先存储为步骤识别信息 ，以及具有至少对应于生产步骤和项目之间的预先步骤信息。 在这种情况下，计算处理部基于存储在存储部中的运送计划信息，部件表和步骤信息来识别并确定涉及产品生产的生产步骤和计算顺序，确定第一 并且基于计算顺序并且基于针对每个生产步骤存储的步骤识别信息来执行第二生产计划计算算法，并且通过使用所确定的算法来计算生产计划。