IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v27y1980i4p597-608.html
   My bibliography  Save this article

A network flow approach for capacity expansion problems with two facility types

Author

Listed:
  • Hanan Luss

Abstract

A deterministic capacity expansion model for two facility types with a finite number of discrete time periods is described. The model generalizes previous work by allowing for capacity disposals, in addition to capacity expansions and conversions from one facility type to the other. Furthermore, shortages of capacity are allowed and upper bounds on both shortages and idle capacities can be imposed. The demand increments for additional capacity of any type in any time period can be negative. All cost functions are assumed to be piecewise, concave and nondecreasing away from zero. The model is formulated as a shortest path problem for an acyclic network, and an efficient search procedure is developed to determine the costs associated with the links of this network.

Suggested Citation

  • Hanan Luss, 1980. "A network flow approach for capacity expansion problems with two facility types," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(4), pages 597-608, December.
    • Handle: RePEc:wly:navlog:v:27:y:1980:i:4:p:597-608
    DOI: 10.1002/nav.3800270407
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800270407
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800270407?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:wly:navlog:v:27:y:1980:i:4:p:597-608. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.