An efficient generalized network-simplex-based algorithm for manufacturing network flows

An efficient generalized network-simplex-based algorithm for manufacturing network flows

0.00 Avg rating0 Votes
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: , ,
Keywords: programming: linear, networks: flow
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.