Advanced Search
MyIDEAS: Login

Capacity Expansion and Replacement in Growing Markets with Uncertain Technological Breakthroughs


Author Info

  • Sampath Rajagopalan

    (Marshall School of Business, University of Southern California, Los Angeles, California 90089-1421)

  • Medini R. Singh

    (The Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire 03755)

  • Thomas E. Morton

    (Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Registered author(s):


    The accelerated pace of technological change has led to rapid obsolescence of productive capacity in electronics and other industries. Managers must consider the impact of future technologies while making acquisition and replacement decisions in such environments. We consider a problem where a sequence of technological breakthroughs are anticipated but their magnitude and timing are uncertain. A firm, operating in such an environment, must decide how much capacity of the current technology to acquire to meet future demand growth. It must also determine whether to upgrade any of the older vintages. We formulate this problem and present some structural results. Using these results, we then develop a highly efficient regeneration point-based dynamic programming algorithm. The effectiveness of the proposed algorithm is illustrated through a computational study. The sensitivity of the first period decision to various parameters is also explored.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 44 (1998)
    Issue (Month): 1 (January)
    Pages: 12-30

    as in new window
    Handle: RePEc:inm:ormnsc:v:44:y:1998:i:1:p:12-30

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:
    More information through EDIRC

    Related research

    Keywords: Capacity Expansion; Equipment Replacement; Technology Adoption models; Stochastic Dynamic Programming; Management of Technology;


    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. Huisman, K.J.M. & Kort, P.M., 1999. "Strategic Technology Investment under Uncertainty," Discussion Paper 1999-18, Tilburg University, Center for Economic Research.
    2. Martínez-Costa, Carme & Mas-Machuca, Marta & Benedito, Ernest & Corominas, Albert, 2014. "A review of mathematical programming models for strategic capacity planning in manufacturing," International Journal of Production Economics, Elsevier, vol. 153(C), pages 66-85.
    3. Porteus, Evan L. & Angelus, Alexandar & Wood, Samuel C., 2000. "Optimal Sizing and Timing of Modular Capacity Expansions," Research Papers 1479r2, Stanford University, Graduate School of Business.
    4. Lin, James T. & Chen, Tzu-Li & Chu, Hsiao-Ching, 2014. "A stochastic dynamic programming approach for multi-site capacity planning in TFT-LCD manufacturing under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 148(C), pages 21-36.
    5. Huisman, K.J.M. & Kort, P.M., 2003. "Strategic investment in technological innovations," Open Access publications from Tilburg University urn:nbn:nl:ui:12-90069, Tilburg University.
    6. Rahman, Atiqur & Loulou, Richard, 2001. "Technology acquisition with technological progress: effects of expectations, rivalry and uncertainty," European Journal of Operational Research, Elsevier, vol. 129(1), pages 159-185, February.
    7. Hadjinicola, George C. & Soteriou, Andreas C., 2003. "Reducing the cost of defects in multistage production systems: A budget allocation perspective," European Journal of Operational Research, Elsevier, vol. 145(3), pages 621-634, March.
    8. Chand, Suresh & McClurg, Tim & Ward, Jim, 2000. "A model for parallel machine replacement with capacity expansion," European Journal of Operational Research, Elsevier, vol. 121(3), pages 519-531, March.
    9. Yatsenko, Yuri & Hritonenko, Natali, 2008. "Properties of optimal service life under technological change," International Journal of Production Economics, Elsevier, vol. 114(1), pages 230-238, July.
    10. Cao, M.F. & Huang, G.H. & Lin, Q.G., 2010. "Integer programming with random-boundary intervals for planning municipal power systems," Applied Energy, Elsevier, vol. 87(8), pages 2506-2516, August.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:44:y:1998:i:1:p:12-30. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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