A network simplex algorithm for simple manufacturing network model

Jiangtao Mo; Liqun Qi; Zengxin Wei

doi:10.3934/jimo.2005.1.251

Article Contents

2005, Volume 1, Issue 2: 251-273. Doi: 10.3934/jimo.2005.1.251

This issue Previous Article A smoothing projected Newton-type method for semismooth equations with bound constraints Next Article

A network simplex algorithm for simple manufacturing network model

1.
School of Science, Xian Jiaotong University, Xian, Shanxi, 710049
2.
Department of Applied Mathematics, Hong Kong Polytechnic University, Kowloon, Hong Kong
3.
School of Mathematics and Information Science, Guangxi University, Guangxi, 53004

Received: May 31, 2004

Revised: November 30, 2004

Published: March 2005

Abstract Related Papers Cited by

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.

Keywords:

Mathematics Subject Classification: 90B10, 90B30, 90C08, 90C35.

Citation:

Article Metrics

HTML views() PDF downloads(450) Cited by(0)

A network simplex algorithm for simple manufacturing network model

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

A network simplex algorithm for simple manufacturing network model

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content