A maximal flow algorithm for the manufacturing network
From MaRDI portal
Publication:5490704
zbMATH Open1119.90010MaRDI QIDQ5490704FDOQ5490704
Authors: Yuanfu Zhang, Zhengdao Ye, Jingbo Tang 
Publication date: 4 October 2006
Recommendations
- The algorithm of maximum flow and minimum cost for manufacturing network
- Manufacturing network flows: a generalized network flow model for manufacturing process modelling
- An efficient generalized network-simplex-based algorithm for manufacturing network flows
- A note on a generalized network flow model for manufacturing process
- A network simplex algorithm for simple manufacturing network model
Cited In (5)
- The algorithm of maximum flow and minimum cost for manufacturing network
- Maximum flow problem in the distribution network
- Manufacturing network flows: a generalized network flow model for manufacturing process modelling
- Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production
- Maximal flow network modelling of production bottleneck problems
This page was built for publication: A maximal flow algorithm for the manufacturing network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490704)
