A New Well-Solvable Class of PNS Problems

Abstract

A manufacturing system consists of operating units which convert their input materials into their output materials. In the problem of designing a process network, we have to find a suitable network of operating units which produces the desired products from the given raw materials. If we consider this process network design problem from a structural point of view, then we obtain a combinatorial optimization problem called the Process Network Synthesis or (PNS) problem. It is known that the PNS problem is NP-complete. Here, a new method is presented to reduce the solution of some more difficult PNS problems to the solution of simpler ones, and using this method, a new well-solvable class of PNS problems is established.