IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v32y1986i11p1467-1479.html
   My bibliography  Save this article

Sequencing Capacity Expansion Projects in Continuous Time

Author

Listed:
  • A. W. Neebe

    (Graduate School of Business Administration and Curriculum in Operations Research and Systems Analysis, University of North Carolina, Chapel Hill, North Carolina 27514)

  • M. R. Rao

    (Graduate School of Business Administration, New York University, New York, New York 10006 and Indian Institute of Management, Bangalore, India)

Abstract

We consider a problem of sequencing capacity expansion projects with a continuous demand function specified over a given time horizon. Each type of expansion project has a specified integer capacity and an associated cost which is nonincreasing with respect to the time at which the project is brought on stream. The problem is to determine the sequence of expansions to provide sufficient capacity to meet demand at minimum cost. A formulation is presented and its relaxation leads to a shortest route problem. The sequencing problem is solved using a branch and bound procedure with Lagrangean relaxation providing bounds. A particularly effective heuristic is also developed. Computational results are given.

Suggested Citation

  • A. W. Neebe & M. R. Rao, 1986. "Sequencing Capacity Expansion Projects in Continuous Time," Management Science, INFORMS, vol. 32(11), pages 1467-1479, November.
    • Handle: RePEc:inm:ormnsc:v:32:y:1986:i:11:p:1467-1479
    DOI: 10.1287/mnsc.32.11.1467
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.32.11.1467
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.32.11.1467?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
    ---><---

    Citations

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


    Cited by:

    1. Metin Çakanyıldırım & Robin O. Roundy & Samuel C. Wood, 2004. "Optimal machine capacity expansions with nested limitations under stochastic demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(2), pages 217-241, March.
    2. Yang, Qing & Zhang, Lei & Zou, Shaohui & Zhang, Jinsuo, 2020. "Intertemporal optimization of the coal production capacity in China in terms of uncertain demand, economy, environment, and energy security," Energy Policy, Elsevier, vol. 139(C).
    3. Cantamessa, Marco & Valentini, Carlo, 2000. "Planning and managing manufacturing capacity when demand is subject to diffusion effects," International Journal of Production Economics, Elsevier, vol. 66(3), pages 227-240, July.

    More about this item

    Keywords

    capacity expansion; Lagrangean relaxation;

    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:inm:ormnsc:v:32:y:1986:i:11:p:1467-1479. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.