A note on a generalized network flow model for manufacturing process

DOI10.1007/S10255-005-5157-7MaRDI QIDQ1036893zbMATH OpenOpenAlexFDO

Authors Haiyan Lu, Enyu Yao, Binwu Zhang

Publication date 13 November 2009

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-005-5157-7

zbMATH Keywords

partially ordered setminimum cost network flownetwork simplex methodextended cycleinitial basic feasible solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• Some further results on minimum distribution cost flow problems
• Minimum cost problem of manufacturing network flows
• A network simplex algorithm for simple manufacturing network model

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 864788 (Why is no real title available?)
• A polynomial time primal network simplex algorithm for minimum cost flows
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• Network flows. Theory, algorithms, and applications.
• On the simplex algorithm for networks and generalized networks

Cited in

(9)

• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• An aggregation procedure for simulating manufacturing flow line models
• A maximal flow algorithm for the manufacturing network
• Maximum flows in generalized processing networks
• An efficient generalized network-simplex-based algorithm for manufacturing network flows
• Some further results on minimum distribution cost flow problems
• A manufacturing supply chain optimization model for distilling process
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• Minimum cost problem of manufacturing network flows

This page was built for publication: A note on a generalized network flow model for manufacturing process

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