Process graph
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
In graph theory a process-graph is a directed bipartite graph used in workflow modeling.
The vertices of the graph[disambiguation needed] are of two types, operation (O) and material (M). The two vertex types form two disjunctive sets. The edges of the graph link the O and M vertices. An edge from an operation vertex (O) connects to a material vertex (M) if M is the output of O, such as a 'document' (material) that is output by a 'write-up' (operation). An edge from M to O indicates that M is an element of the input set of O, e.g. a document may be part of the input to a 'review' operation.
Applications
Process-graph is in use in different fields of application in Process Synthesis.[1] An example for an application is Process Network Synthesis.[2] The method is in scientific use to find optimum process chains in chemical formulas, energy technology networks and other optimisation problems like evacuation routes in buildings or transportation routes.
References
- ^ Friedler, F.; Huang, Y.W.; Fan, L.T. (1992). "Combinatorial Algorithms for Process Synthesis". Computers Chemical Engineering. 16 Suppl. 1 (0): 313–320. doi:10.1016/S0098-1354(09)80037-9. Retrieved 11 August 2014.
- ^ Friedler, F.; Varga, J. B.; Feher, E.; Fan, L. T. (1996). Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis (7 ed.). Dordrecht: Kluwer Academic Publishers. pp. 609–626. ISBN 0-7923-4351-4.