IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v76y1998i0p323-34210.1023-a1018904806854.html
   My bibliography  Save this article

Solution procedures for the dynamic facility layout problem

Author

Listed:
  • Timothy Urban

Abstract

Existing optimal solution procedures for the dynamic facility layout problem require the repeated solution of quadratic assignment problems within the framework of a dynamic program. The computational requirements for this problem necessitate the development of efficient algorithms for special cases of the problem and strong bounds for the general case of the problem. The concept of incomplete dynamic programming is applied to the dynamic facility layout problem to find the optimal solution to the problem with fixed rearrangement costs at exceptionally reduced solution times. Heuristics are also developed to provide a solution methodology for larger problems. A lower bound is developed for the general problem that dominates all existing bounds, and it is shown how the bound can be used as an initial test for optimality before the dynamic program is solved. Finally, the incomplete dynamic programming methodology is extended to find an upper bound for the general problem that dominates all previous bounds. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Timothy Urban, 1998. "Solution procedures for the dynamic facility layout problem," Annals of Operations Research, Springer, vol. 76(0), pages 323-342, January.
    • Handle: RePEc:spr:annopr:v:76:y:1998:i:0:p:323-342:10.1023/a:1018904806854
    DOI: 10.1023/A:1018904806854
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018904806854
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018904806854?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.

    Citations

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


    Cited by:

    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Dunker, Thomas & Radons, Gunter & Westkamper, Engelbert, 2005. "Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 55-69, August.
    3. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
    4. Saif Benjaafar & Sunderesh S. Heragu & Shahrukh A. Irani, 2002. "Next Generation Factory Layouts: Research Challenges and Recent Progress," Interfaces, INFORMS, vol. 32(6), pages 58-76, December.
    5. Kuldeep Lamba & Ravi Kumar & Shraddha Mishra & Shubhangini Rajput, 2020. "Sustainable dynamic cellular facility layout: a solution approach using simulated annealing-based meta-heuristic," Annals of Operations Research, Springer, vol. 290(1), pages 5-26, July.

    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:spr:annopr:v:76:y:1998:i:0:p:323-342:10.1023/a:1018904806854. 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.springer.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.