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

An integrated approach to dynamic plant location and capacity planning

Author

Listed:
  • S-K Lim

    (Korea Advanced Institute of Science and Technology)

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology)

Abstract

We consider a dynamic capacitated plant location problem in which capacities of opened plants are determined by acquisition and/or disposal of multiple types of facilities. We determine the opening schedule of plants, allocations of customers' demands and plans for acquisition and/or disposal of plant capacities that minimise the sum of discounted fixed costs for opening plants, delivery costs of products, and acquisition and operation costs of facilities. The dynamic capacitated plant location problem is formulated as a mixed integer linear program and solved by a heuristic algorithm based on Lagrangian relaxation and a cut and branch algorithm which uses Gomory cuts. Several solution properties of the relaxed problem are found and used to develop efficient solution procedures for the relaxed problem. A subgradient optimisation method is employed to obtain better lower bounds. The heuristic algorithm is tested on randomly generated test problems and results show that the algorithm finds good solutions in a reasonable amount of computation time.

Suggested Citation

  • S-K Lim & Y-D Kim, 1999. "An integrated approach to dynamic plant location and capacity planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(12), pages 1205-1216, December.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:12:d:10.1057_palgrave.jors.2600849
    DOI: 10.1057/palgrave.jors.2600849
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600849
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600849?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.

    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:50:y:1999:i:12:d:10.1057_palgrave.jors.2600849. 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.