Minimum cost problem of manufacturing network flows

MaRDI QIDQ3501699zbMATH OpenFDO

Authors Xiaoqing Xu, Heng-Yong Tang

Publication date 3 June 2008

zbMATH Keywords

manufacturing network flowsminimum cost problemnetwork simplex method

Mathematics Subject Classification ID

Production models (90B30) Programming involving graphs or networks (90C35)

Recommendations

• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• A network simplex algorithm for simple manufacturing network model
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• The algorithm of maximum flow and minimum cost for manufacturing network
• A note on a generalized network flow model for manufacturing process

Cited in

(8)

• A note on a generalized network flow model for manufacturing process
• A network simplex algorithm for simple manufacturing network model
• Minimum cost multi-product flow lines
• Minimum cost problem of assembly network flows
• The algorithm of maximum flow and minimum cost for manufacturing network
• A manufacturing supply chain optimization model for distilling process
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• Minimizing costs can be costly

This page was built for publication: Minimum cost problem of manufacturing network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3501699)