IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i2d10.1057_palgrave.jors.2601071.html
   My bibliography  Save this article

Maximal flow network modelling of production bottleneck problems

Author

Listed:
  • M D Troutt

    (Kent State University)

  • G P White

    (Southern Illinois University)

  • S K Tadisina

    (Southern Illinois University)

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.

Suggested Citation

  • M D Troutt & G P White & S K Tadisina, 2001. "Maximal flow network modelling of production bottleneck problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(2), pages 182-187, February.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:2:d:10.1057_palgrave.jors.2601071
    DOI: 10.1057/palgrave.jors.2601071
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601071
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601071?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Davies, J. & Mabin, V.J. & Balderstone, S.J., 2005. "The theory of constraints: a methodology apart?--a comparison with selected OR/MS methodologies," Omega, Elsevier, vol. 33(6), pages 506-524, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:52:y:2001:i:2:d:10.1057_palgrave.jors.2601071. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.