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

Multiperiod capacity expansion and shipment planning with linear costs

Author

Listed:
  • C. O. Fong
  • V. Srinivasan

Abstract

In this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non‐decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided.

Suggested Citation

  • C. O. Fong & V. Srinivasan, 1976. "Multiperiod capacity expansion and shipment planning with linear costs," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(1), pages 37-52, March.
  • Handle: RePEc:wly:navlog:v:23:y:1976:i:1:p:37-52
    DOI: 10.1002/nav.3800230106
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800230106
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.3800230106?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:23:y:1976:i:1:p:37-52. 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.