1. ¹Kent State University, OH, USA
2. ²Southern Illinois University, IL, USA

Correspondence: M D Troutt, College of Business Administration, Management and Information Systems, Graduate School of Management, Kent State University, P.O. Box 5190, Kent, OH, 44242-0001, USA. E-mail: mtroutt@bsa3.kent.edu

Received April 1999; Accepted September 2000.

Abstract

This paper considers the analysis of process networks with bottlenecks and shows how they may be regarded as simple multi-source maximal flow linear programming problems. We surveyed over 30 Production/Operations Management and management science/OR textbooks, finding that only iterative trial-and-error procedures are now being suggested for this kind of analysis. The maximal flow network approach is easier for complex problems and also allows several advantages not available in the trial-and-error approaches. This paper also discusses the use of a simple linear programming sensitivity result called radial change. The modelling approach suggested here can provide new ideas for improving system capacity following the application of Theory of Constraints techniques.