A New Well-Solvable Class of PNS Problems |
| |
Authors: | Cs Imreh |
| |
Affiliation: | (1) Department of Informatics University of Szeged H-6701 Szeged P.O. Box 652 Hungary e-mail: cimreh@inf.u-szeged.hu, HU |
| |
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.
Received February 12, 1999; revised October 24, 2000 |
| |
Keywords: | AMS Subject Classifications: 90C27 94C15 |
本文献已被 SpringerLink 等数据库收录! |
|