SYSTEM AND METHOD FOR INCREASING USAGE OF RECYCLING IN MANUFACTURING PROCESSES

• US 20090132314A1
• Filed: 09/24/2008
• Published: 05/21/2009
• Est. Priority Date: 09/28/2007
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Franco, Lucas G.
• Application Number:
  US12/236,535
• Publication Number:
  US 20090132314A1
• Time in Patent Office: Days
• US Class Current: 705/7
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/0633 Workflow analysis
• CPC Class Codes: G06Q 50/04 Manufacturing
• CPC Class Codes: Y02P 90/30 Computing systems specially adapted for manufacturing

Abstract

A system and method for optimizing manufacturing processes to increase usage of recycling in a manufacturing process. In an embodiment, the method comprises: describing a manufacturing process using a plurality of nodes, each node representing a component or a process; connecting the plurality of nodes with directed edges to form a directed graph, the directed graph representing possible manufacturing process flows from a begin node to an end node; assigning to each edge a value representative of the benefit resulting from usage of recycling in a component or process; and determining a longest path from the begin node to the end node in the directed graph to identify a manufacturing process flow maximizing usage of recycling in the manufacturing process.

Claims

1. A method of optimizing a manufacturing process to increase usage of recycling in said manufacturing process, comprising:

describing the manufacturing process using a plurality of nodes, each node representing a component or a process;

connecting the plurality of nodes with directed edges to form a directed graph, the directed graph representing possible manufacturing process flows from a begin node to an end node;

assigning to each edge a value representative of a benefit resulting from usage of recycling in a component or process; and

determining a longest path from the begin node to the end node in the directed graph to identify a manufacturing process flow maximizing usage of recycling in the manufacturing process.

2. The method of claim 1, wherein the method further comprises:

building a cost matrix representing an array of the plurality of nodes, with values in the cost matrix representing the edge values between nodes;

inverting the edge values in the cost matrix; and

executing a modified Dijkstra'"'"'s shortest path algorithm, wherein the algorithm is run from the end node instead of the begin node, to determine the longest path from the begin node to the end node in the directed graph.

3. The method of claim 2, further comprising identifying the nodes in the longest path, and presenting an ordered combination of any components or processes in the longest path as the solution for maximizing usage of recycling in the manufacturing process.

4. The method of claim 2, further comprising modifying the directed graph to incorporate new information by adding or deleting nodes or edges, and by adding or modifying edge values.

5. The method of claim 4, further comprising providing a graphical user interface adapted to allow a user to modify the directed graph by adding or deleting node objects or edge objects, and by adding or modifying edge values associated with the edge objects.

6. The method of claim 5, further comprising converting the directed graph in the graphical user interface into a new cost matrix.

7. The method of claim 6, further comprising re-executing the modified Dijkstra'"'"'s shortest path algorithm on the new cost matrix to identify the longest path from the begin node to the end node.

8. A system for optimizing a manufacturing process to increase usage of recycling in a manufacturing process, comprising:

means for describing the manufacturing process using a plurality of nodes, each node representing a component or a process;

means for connecting the plurality of nodes with directed edges to form a directed graph, the directed graph representing possible manufacturing process flows from a begin node to an end node;

means for assigning to each edge a value representative of a benefit resulting from usage of recycling in a component or process; and

means for determining a longest path from the begin node to the end node in the directed graph to identify a manufacturing process flow maximizing usage of recycling in the manufacturing process.

9. The system of claim 8, wherein the method further comprises:

means for building a cost matrix representing an array of the plurality of nodes, with values in the cost matrix representing the edge values between nodes;

means for inverting the edge values in the cost matrix; and

means for executing a modified Dijkstra'"'"'s shortest path algorithm, wherein the algorithm is run from the end node instead of the begin node, to determine the longest path from the begin node to the end node in the directed graph.

10. The system of claim 9, further comprising means for identifying the nodes in the longest path, and presenting an ordered combination of any components or processes in the longest path as the solution for maximizing usage of recycling in the manufacturing process.

11. The system of claim 9, further comprising means for modifying the directed graph to incorporate new information by adding or deleting nodes or edges, and by adding or modifying edge values.

12. The system of claim 11, further comprising means for providing a graphical user interface adapted to allow a user to modify the directed graph by adding or deleting node objects or edge objects, and by adding or modifying edge values associated with the edge objects.

13. The system of claim 12, further comprising means for converting the directed graph in the graphical user interface into a new cost matrix.

14. The system of claim 13, further comprising means for re-executing the modified Dijkstra'"'"'s shortest path algorithm on the new cost matrix to identify the longest path from the begin node to the end node.

15. A data processor readable medium storing data processor code that when loaded onto and executed by a data processing device adapts the device to execute a method of optimizing a manufacturing process to increase usage of recycling in a manufacturing process, the data processor readable medium comprising:

code for describing the manufacturing process using a plurality of nodes, each node representing a component or a process;

code for connecting the plurality of nodes with directed edges to form a directed graph, the directed graph representing possible manufacturing process flows from a begin node to an end node;

code for assigning to each edge a value representative of a benefit resulting from usage of recycling in a component or process; and

code for determining a longest path from the begin node to the end node in the directed graph to identify a manufacturing process flow maximizing usage of recycling in the manufacturing process.

16. The data processor readable medium of claim 15, further comprising:

code for building a cost matrix representing an array of the plurality of nodes, with values in the cost matrix representing the edge values between nodes;

code for inverting the edge values in the cost matrix; and

code for executing a modified Dijkstra'"'"'s shortest path algorithm, wherein the algorithm is run from the end node instead of the begin node, to determine the longest path from the begin node to the end node in the directed graph.

17. The data processor readable medium of claim 16, further comprising code for identifying the nodes in the longest path, and presenting an ordered combination of any components or processes in the longest path as the solution for maximizing usage of recycling in the manufacturing process.

18. The data processor readable medium of claim 16, further comprising code for modifying the directed graph to incorporate new information by adding or deleting nodes or edges, and by adding or modifying edge values.

19. The data processor readable medium of claim 18, further comprising code for providing a graphical user interface adapted to allow a user to modify the directed graph by adding or deleting node objects or edge objects, and by adding or modifying edge values associated with the edge objects.

20. The data processor readable medium of claim 19, further comprising code for converting the directed graph in the graphical user interface into a new cost matrix.

21. The data processor readable medium of claim 20, further comprising code for re-executing the modified Dijkstra'"'"'s shortest path algorithm on the new cost matrix to identify the longest path from the begin node to the end node.