NDLI: A note on a generalized network flow model for manufacturing process

Content Provider	Springer Nature Link
Author	Lu, Hai yan Zhang, Bin wu Yao, En yu
Copyright Year	2009
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.
Ending Page	60
Page Count	10
Starting Page	51
File Format	PDF
ISSN	01689673
e-ISSN	16183932
Journal	Acta Mathematicae Applicatae Sinica
Issue Number	1
Volume Number	25
Language	English
Publisher	Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Publisher Date	2008-12-11
Publisher Place	Heildeberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	partially ordered set network simplex method extended cycle Mathematical and Computational Physics initial basic feasible solution Network models, deterministic Math Applications in Computer Science Applications of Mathematics Minimum cost network flow Combinatorial optimization Programming involving graphs or networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Inverse minimum flow problem

On minimal extended representations of generalized power cones

Minimum concave cost flow over a grid network

The inverse maximum dynamic flow problem

Extended maximum concurrent flow problem with saturated capacity

Sequential and parallel algorithms for minimum flows

Feasible bases for a polytope related to the Hamilton cycle problem

On the computational complexity of minimum-concave-cost flow in a two-dimensional grid

Heuristic solutions to robust variants of the minimum-cost integer flow problem

A note on a generalized network flow model for manufacturing process

Similar Documents

Inverse minimum flow problem

On minimal extended representations of generalized power cones

Minimum concave cost flow over a grid network

The inverse maximum dynamic flow problem

Extended maximum concurrent flow problem with saturated capacity

Sequential and parallel algorithms for minimum flows

Feasible bases for a polytope related to the Hamilton cycle problem

On the computational complexity of minimum-concave-cost flow in a two-dimensional grid

Heuristic solutions to robust variants of the minimum-cost integer flow problem

A note on a generalized network flow model for manufacturing process