A METHOD FOR SUPPLY CHAIN DECOMPOSITION

• US 20050171826A1
• Filed: 01/29/2004
• Published: 08/04/2005
• Est. Priority Date: 01/29/2004
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Forrest, John J., Denton, Brian T.
• Application Number:
  US10/707,977
• Publication Number:
  US 20050171826A1
• Time in Patent Office: Days
• US Class Current: 705/8
• CPC Class Codes: G06Q 10/063 Operations research, analysis or management
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

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.

Claims

1. A method for decomposing a linear program comprising:

relaxing material balance and sourcing constraints of said linear program based on stocking point criteria;

initially solving the linear program with relaxed material balance and sourcing constraints to produce an initial solution;

replacing variables in said linear program with constants based on said initial solution;

restoring said material balance and sourcing constraints; and

finally solving the linear program using said constants and with all constraints in place to obtain a complete solution of said linear program.

2. The method in claim 1, further comprising, before initially solving said linear program, decomposing said linear program into smaller independent linear programs, wherein said process of initially solving said linear program solves said smaller independent linear programs simultaneously in parallel.

3. The method in claim 1, further comprising selecting material balance and sourcing constraints that are associated with the least complex parts within bills-of-materials used by said linear program as said relaxed material balance and sourcing constraints.

4. The method in claim 1, further comprising selecting material balance and sourcing constraints that are associated with parts that have supply availability and lack capacity constraints as said relaxed material balance and sourcing constraints.

5. The method in claim 1, further comprising selecting material balance and sourcing constraints that are associated with parts that are available during the planning horizon of said linear program as said relaxed material balance and sourcing constraints.

6. The method in claim 5, wherein said planning horizon includes an initial planning horizon, shipping lead time, and manufacturing cycle time.

7. The method in claim 1, wherein said stocking point criteria relates to time dependent stocking points comprising part numbers, locations of parts identified by said part numbers, and the time periods when said parts will be available.

8. A method for solving a linear program having constraints in a production planning system, said method comprising:

determining which of said constraints can be temporarily relaxed;

relaxing selected constraints of said linear program based on said determining process;

decomposing said linear program into smaller independent linear programs;

initially solving said smaller independent linear program with relaxed constraints to produce an initial solution;

replacing variables in said linear program with constants based on said initial solution;

restoring said material balance and sourcing constraints; and

finally solving said linear program using said constants and with all constraints in place to obtain a complete solution of said linear program.

9. The method in claim 8, wherein said process of initially solving said smaller independent linear programs solves said smaller independent linear programs simultaneously in parallel.

10. The method in claim 8, wherein said determining process identifies constraints that are associated with the least complex parts within bills-of-materials used by said linear program as said constraints that can be temporarily relaxed.

11. The method in claim 8, wherein said determining process identifies constraints that are associated with parts that have supply availability and lack capacity constraints as said constraints that can be temporarily relaxed.

12. The method in claim 8, wherein said determining process identifies constraints that are associated with parts that are available during the planning horizon of said linear program as said constraints that can be temporarily relaxed.

13. The method in claim 12, wherein said planning horizon includes an initial planning horizon, shipping lead time, and manufacturing cycle time.

14. The method in claim 8, wherein said determining process is based on stocking point criteria.

15. A method for solving a linear program having constraints in a production planning system, said method comprising:

determining which of said constraints can be temporarily relaxed based on stocking point criteria that relates to time dependent stocking points comprising part numbers, locations of parts identified by said part numbers, and the time periods when said parts will be available;

relaxing selected constraints of said linear program based on said determining process;

decomposing said linear program into smaller independent linear programs;

initially solving said smaller independent linear program with relaxed constraints to produce an initial solution;

replacing variables in said linear program with constants based on said initial solution;

restoring said material balance and sourcing constraints; and

finally solving the linear program using said constants and with all constraints in place to obtain a complete solution of said linear program.

16. The method in claim 15, wherein said process of initially solving said smaller independent linear programs solves said smaller independent linear programs simultaneously in parallel.

17. The method in claim 15, wherein said determining process identifies constraints that are associated with the least complex parts within bills-of-materials used by said linear program as said constraints that can be temporarily relaxed.

18. The method in claim 15, wherein said determining process identifies constraints that are associated with parts that have supply availability and lack capacity constraints as said constraints that can be temporarily relaxed.

19. The method in claim 15, wherein said determining process identifies constraints that are associated with parts that are available during the planning horizon of said linear program as said constraints that can be temporarily relaxed.

20. The method in claim 19, wherein said planning horizon includes an initial planning horizon, shipping lead time, and manufacturing cycle time.

21. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform a method for solving a linear program having constraints in a production planning system, said method comprising:

determining which of said constraints can be temporarily relaxed;

relaxing selected constraints of said linear program based on said determining process;

decomposing said linear program into smaller independent linear programs;

initially solving said smaller independent linear program with relaxed constraints to produce an initial solution;

replacing variables in said linear program with constants based on said initial solution;

restoring said material balance and sourcing constraints; and

finally solving said linear program using said constants and with all constraints in place to obtain a complete solution of said linear program.