Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/34789
Title: A network simplex algorithm for simple manufacturing network model
Authors: Mo, J
Qi, L 
Wei, Z
Keywords: Multicommodity network
Optimization model
Minimum cost flow
Network simplex algorithm
Distilling process
Issue Date: 2005
Publisher: American Institute of Mathematical Sciences
Source: Journal of industrial and management optimization, 2005, v. 1, no. 2, p. 251-273 How to cite?
Journal: Journal of industrial and management optimization
Abstract: In this paper, we propose a network model called simple manufacturing network. Our model is a combined version of the ordinary multicommodity network and the manufacturing network flow model. It can be used to characterize the complicated manufacturing scenarios. By formulating the model as a minimum cost flow problem plus several bounded variables, we present a modified network simplex method, which exploits the special structure of the model and can perform the computation on the network. A numerical example is provided for illustrating our method.
URI: http://hdl.handle.net/10397/34789
ISSN: 1547-5816 (print)
1553-166X (online)
DOI: 10.3934/jimo.2005.1.251
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

10
Last Week
0
Last month
Checked on Jan 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.