Manufacturing network flows: A generalized network flow model for manufacturing process modelling

被引:17
作者
Fang, SC [1 ]
Qi, LQ
机构
[1] N Carolina State Univ, Dept Ind Engn, Raleigh, NC 27695 USA
[2] N Carolina State Univ, Grad Program Operat Res, Raleigh, NC 27695 USA
[3] Hong Kong Polytech Univ, Dept Math Appl, Kowloon, Hong Kong, Peoples R China
关键词
network flow; manufacturing; process and product management; mathematical modelling;
D O I
10.1080/1055678031000152079
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Network flow models have been shown to be theoretically interesting and practically useful. However, an ordinary network flow has its limitation in modelling more complicated manufacturing scenarios, in particular the synthesis of different materials to one product and/or the distilling of one material to many different products. In this paper, we present a generalized network model called manufacturing network flow (MNF) for this purpose. The underlying structure and dual properties of the so-called minimum distribution cost problem is specifically studied to outline a network simplex method for solving this problem.
引用
收藏
页码:143 / 165
页数:23
相关论文
共 8 条
[1]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[2]  
Askin R.G., 1993, MODELING ANAL MANUFA
[3]  
BAZARAA MS, 1990, LINEAR PROGRAMMING N
[4]  
Ford L. R, 1962, FLOWS NETWORKS
[5]  
Lawler E., 1976, Combinatorial Optimization: Networks and Matroids
[6]  
LEONDES C, 2001, COMPUTER INTEGRATED
[7]  
MURTY KG, 1992, NETWORK PROGRAMMING
[8]  
Papadimitriou Christos H., 1981, Combinatorial Optimization: Algorithms and Complexity