The maximum concurrent flow problem
Journal of the ACM (JACM)
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Hi-index | 0.98 |
It has long been recognized that productivity in manufacturing plants can often be increased by producing similar products in cells. This involves 1.(i) assigning parts to individual machines, and 2.(ii) forming machines into cells. These two activities have traditionally been carried out separately. However, most solution procedures for (i) above utilize a solution to (ii), and vice versa. Here we present a unified approach that deals with (i) and (ii) simultaneously. The approach is based on a multicommodity circulation minimum cost network flow model with side constraints.