SYSTEM AND METHOD FOR REDUCING TOXIC WASTE IN MANUFACTURING PROCESSES

• US 20090132079A1
• Filed: 09/23/2008
• Published: 05/21/2009
• Est. Priority Date: 09/28/2007
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Franco, Lucas G.
• Granted Patent: US 7,908,022 B2
• Time in Patent Office: Days
• US Class Current: 700/103
• CPC Class Codes: G06Q 10/06 Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
• CPC Class Codes: G06Q 30/0283 Price estimation or determination

Abstract

A system and method of optimizing a manufacturing process so as to reduce toxic waste in the process. In an embodiment, the method includes: 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 cost resulting from toxic waste generated by a component or process; and determining a shortest path from the begin node to the end node in the directed graph to identify manufacturing process flow having a minimum cost.

Claims

1. A method of optimizing a manufacturing process so as to reduce toxic waste in such 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 cost resulting from toxic waste generated by a component or process; and

determining a shortest path from the begin node to the end node in the directed graph to identify a manufacturing process flow having a minimum cost.

2. The method of claim 1, further comprising:

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

executing a modified Dijkstra'"'"'s shortest path algorithm on the cost matrix, wherein the algorithm is run from the end node instead of the begin node, to determine the shortest 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 shortest path, and presenting an ordered combination of any components or processes in the shortest path as a solution for minimizing toxic waste 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 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 shortest path from the begin node to the end node.

8. A system for optimizing a manufacturing process so as to reduce toxic waste 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 cost resulting from toxic waste generated by a component or process; and

means for determining a shortest path from the begin node to the end node in the directed graph to identify a manufacturing process flow having a minimum cost.

9. The system of claim 8, further comprising:

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; and

means for executing a modified Dijkstra'"'"'s shortest path algorithm on the cost matrix, wherein the algorithm is run from the end node instead of the begin node.

10. The system of claim 9, further comprising means for identifying the nodes in the shortest path, and presenting an ordered combination of any components or processes in the shortest path as the solution for minimizing toxic waste 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 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 shortest 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 so as to reduce toxic waste in said 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 cost resulting from toxic waste generated by a component or process; and

code for determining a shortest path from the begin node to the end node in the directed graph to identify a manufacturing process flow having a minimum cost.

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; and

code for executing a modified Dijkstra'"'"'s shortest path algorithm on the cost matrix, wherein the algorithm is run from the end node instead of the begin node.

17. The data processor readable medium of claim 16, further comprising code for identifying the nodes in the shortest path, and presenting an ordered combination of any components or processes in the shortest path as the solution for minimizing toxic waste 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 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 shortest path from the begin node to the end node.