Abstract
Manufacturing network flow (MNF) is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of different materials into one product and/or the distilling of one type of material into many different products. Though a network simplex method for solving a simplified version of MNF has been outlined in the literature, more research work is still needed to give a complete answer whether some classical duality and optimality results of the classical network flow problem can be extended in MNF. In this paper, we propose an algorithmic method for obtaining an initial basic feasible solution to start the existing network simplex algorithm, and present a network-based approach to checking the dual feasibility conditions. These results are an extension of those of the ordinary network flow problem.
Similar content being viewed by others
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.R. Network flows: Theory, Algorithms, and applications. Prentice Hall, New Jersey, 1993
Askin, R.G., Standridge, C.R. Modeling and Analysis of Manufacturing Systems. John Wiley & Sons, New York, 1993
Bazarra, M.S., Jarvis, J.J. Linear Programming and Network Flows. John Wiley & Sons, New York, 1977
Brauldi, R.A. Introductory Combinatorics. China Machine Press, Beijing, 2002
Fang, S.C., Qi, L Q. Manufacturing network flows: a generalized network flow model for manufacturing process modeling. Optimization Methods and Software, 18: 143–165 (2003)
Geng, S.Y., Qu, W.L., Wang, H.P. A course in discrete mathematics. Beijing University Press, Beijing, 2002 (in Chinese)
Kolman, B., Busby, R.C., Ross, S.C. Discrete mathematical structures. Higher Education Press, Beijing, 2005
Lawler, E.L. Combinatorial optimization: Networks and matroids. Holt, Rinehart & Winston, New York, 1976
Leondes, C.(Ed.), Computer integrated manufacturing. CRC Press, New York, 2001
Murty, K.G. Network programming. Prentice Hall, New Jersey, 1992
Orlin, J.B. On the simplex algorithm for the networks and generalized networks. Mathematical Programming Study, 24: 166–178 (1985)
Orlin, J.B. A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, 78: 109–129 (1977)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 10371028, No. 10671177), the Key Project of Chinese Ministry of Education (No. 1080607), the Scientific Research Grant of Jiangnan University (No. 314000-52210382), and the Youth Foundation from School of Science of Jiangnan University (January 2008-December 2009).
Rights and permissions
About this article
Cite this article
Lu, Hy., Yao, Ey. & Zhang, Bw. A note on a generalized network flow model for manufacturing process. Acta Math. Appl. Sin. Engl. Ser. 25, 51–60 (2009). https://doi.org/10.1007/s10255-005-5157-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-005-5157-7
Keywords
- Minimum cost network flow
- network simplex method
- initial basic feasible solution
- partially ordered set
- extended cycle