发明申请
- 专利标题: A METHOD FOR SUPPLY CHAIN DECOMPOSITION
- 专利标题(中): 一种供应链分解方法
-
申请号: US10707977申请日: 2004-01-29
-
公开(公告)号: US20050171826A1公开(公告)日: 2005-08-04
- 发明人: Brian Denton , John Forrest
- 申请人: Brian Denton , John Forrest
- 申请人地址: US NY Armonk
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY Armonk
- 主分类号: G06Q10/00
- IPC分类号: G06Q10/00 ; G06F17/60
摘要:
The invention provides a method and system for solving a linear program having constraints in a production planning system. The invention first determines which of the constraints can be temporarily relaxed based on stocking point criteria. The stocking point criteria relates to time dependent stocking points that include part numbers, locations of parts identified by the part numbers, and the time periods when the parts will be available. The invention relaxes the constraints that can be relaxed and decomposes the linear program into smaller independent linear programs. The invention initially solves the smaller independent linear programs with relaxed constraints (simultaneously in parallel) to produce an initial solution. Next, the invention replaces variables in the linear program with constants based on this initial solution. After this the invention restores the material balance and sourcing constraints and finally solves (re-solves) the linear program using the constants and with all constraints in place to obtain a complete solution of the linear program.
信息查询