节点文献
一个制造网络的最大流算法
A Maximal Flow Algorithm for Manufacturing Network
【摘要】 制造网络流广泛应用于解决水源的调度及工厂的产品运输、分配、合成等问题。本文提出一个制造网络流的最大流算法。
【Abstract】 The manufacturing network flow problem is applied widely in the distribution of water source and the transit of products that have some process of synthesis of diflerent materials to one product and/or the distribution of one material to many diflerent products. In this paper, we present a maximal flow algorithm for manufacturing network flow.
【关键词】 制造网络流问题;
最大流;
层数;
最小截;
【Key words】 manufacturing network flow problem; maximum flow; layer; minimum cut;
【Key words】 manufacturing network flow problem; maximum flow; layer; minimum cut;
- 【文献出处】 工程数学学报 ,Chinese Journal of Engineering Mathematics , 编辑部邮箱 ,2005年05期
- 【分类号】O224
- 【被引频次】4
- 【下载频次】209