Article ID: | iaor20091405 |
Country: | Netherlands |
Volume: | 15 |
Issue: | 4 |
Start Page Number: | 315 |
End Page Number: | 341 |
Publication Date: | May 2008 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Mathur Kamlesh, Ballou Ronald H., Venkateshan Prahalad |
Keywords: | programming: linear, networks: flow |
Fang and Qi introduced a new generalized network flow model called manufacturing network flow model for manufacturing process modeling. A key distinguishing feature of such models is the assembling of component raw-materials, in a given proportion, into an end-product. This assembling operation cannot be modeled using usual generalized networks (which allow gains and losses in flows), or using multi-commodity networks (which allow flows of multiple commodity types on a single arc). The authors developed a network-simplex-based algorithm to solve a minimum cost flow problem formulated on such a generalized network.