A maximal flow algorithm for the manufacturing network

MaRDI QIDQ5490704zbMATH OpenFDO

Authors Yuanfu Zhang, Zhengdao Ye, Jingbo Tang

Publication date 4 October 2006

zbMATH Keywords

maximum flowminimum cutlayermanufacturing network flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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)