Path and equipment allocation for multiple, concurrent processes on networked process plant units

The path and equipment allocation problem for batch processes is defined and cast in the context of graph theory. Networks of interconnected process equipment are represented by directed graphs. Inter-unit material transfer paths and equipment allocations are found using a shortest path algorithm and subsequently isolated to prevent cross-contamination. The results are applicable to real-time implementation in operating plants.