IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v87y1995i1p65-73.html
   My bibliography  Save this article

A heuristic procedure for the single-row facility layout problem

Author

Listed:
  • Ravi Kumar, K.
  • Hadjinicola, George C.
  • Lin, Ting-li

Abstract

No abstract is available for this item.

Suggested Citation

  • Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
  • Handle: RePEc:eee:ejores:v:87:y:1995:i:1:p:65-73
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00062-H
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Zvi Drezner, 1987. "A Heuristic Procedure for the Layout of a Large Number of Facilities," Management Science, INFORMS, vol. 33(7), pages 907-915, July.
    2. Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    3. Jouko Seppänen & James M. Moore, 1970. "Facilities Planning with Graph Theory," Management Science, INFORMS, vol. 17(4), pages 242-253, December.
    4. L. R. Foulds, 1983. "Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent," Management Science, INFORMS, vol. 29(12), pages 1414-1426, December.
    5. Kenneth M. Hall, 1970. "An r-Dimensional Quadratic Placement Algorithm," Management Science, INFORMS, vol. 17(3), pages 219-229, November.
    6. Burkard, Rainer E. & Bonniger, Tilman, 1983. "A heuristic for quadratic Boolean programs with applications to quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 13(4), pages 374-386, August.
    7. Giffin, J.W. & Foulds, L.R., 1987. "Facilities layout generalized model solved by n-boundary shortest path heuristics," European Journal of Operational Research, Elsevier, vol. 28(3), pages 382-391, March.
    8. Heragu, Sunderesh S. & Kusiak, Andrew, 1991. "Efficient models for the facility layout problem," European Journal of Operational Research, Elsevier, vol. 53(1), pages 1-13, July.
    9. Gordon C. Armour & Elwood S. Buffa, 1963. "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities," Management Science, INFORMS, vol. 9(2), pages 294-309, January.
    10. Kaku, Bharat K & Thompson, Gerald L., 1986. "An exact algorithm for the general quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 23(3), pages 382-390, March.
    11. Kusiak, Andrew & Heragu, Sunderesh S., 1987. "The facility layout problem," European Journal of Operational Research, Elsevier, vol. 29(3), pages 229-251, June.
    12. Frederick S. Hillier & Michael M. Connors, 1966. "Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities," Management Science, INFORMS, vol. 13(1), pages 42-57, September.
    13. Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
    14. Heragu, Sunderesh S. & Alfa, Attahiru Sule, 1992. "Experimental analysis of simulated annealing based algorithms for the layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 190-202, March.
    15. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    16. Heragu, Sunderesh S., 1992. "Recent models and techniques for solving the layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 136-144, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. repec:spr:ijsaem:v:8:y:2017:i:4:d:10.1007_s13198-014-0314-6 is not listed on IDEAS
    2. Samarghandi, Hamed & Eshghi, Kourosh, 2010. "An efficient tabu algorithm for the single row facility layout problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 98-105, August.
    3. Kothari, Ravi & Ghosh, Diptesh, 2013. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods," European Journal of Operational Research, Elsevier, vol. 224(1), pages 93-100.
    4. Amaral, Andre R.S., 2006. "On the exact solution of a facility layout problem," European Journal of Operational Research, Elsevier, vol. 173(2), pages 508-518, September.
    5. Miguel F. Anjos & Anthony Vannelli, 2008. "Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 611-617, November.
    6. Kothari, Ravi & Ghosh, Diptesh, 2012. "Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood," IIMA Working Papers WP2012-02-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Azadeh, A. & Moghaddam, M. & Asadzadeh, S.M. & Negahban, A., 2011. "An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data," European Journal of Operational Research, Elsevier, vol. 214(3), pages 768-779, November.
    8. Kothari, Ravi & Ghosh, Diptesh, 2012. "Scatter Search Algorithms for the Single Row Facility Layout Problem," IIMA Working Papers WP2012-04-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    9. Kothari, Ravi & Ghosh, Diptesh, 2012. "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Uma Kothari & Diptesh Ghosh, 2012. "A Competitive Genetic Algorithm for Single Row Facility Layout," Working Papers id:4915, eSocialSciences.
    11. Philipp Hungerländer & Franz Rendl, 2013. "A computational study and survey of methods for the single-row facility layout problem," Computational Optimization and Applications, Springer, vol. 55(1), pages 1-20, May.
    12. Kothari, Ravi & Ghosh, Diptesh, 2011. "The Single Row Facility Layout Problem: State of the Art," IIMA Working Papers WP2011-12-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    14. Ghosh, Diptesh, 2011. "An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem," IIMA Working Papers WP2011-08-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Datta, Dilip & Amaral, André R.S. & Figueira, José Rui, 2011. "Single row facility layout problem using a permutation-based genetic algorithm," European Journal of Operational Research, Elsevier, vol. 213(2), pages 388-394, September.
    16. Kothari, Ravi & Ghosh, Diptesh, 2012. "Path Relinking for Single Row Facility Layout," IIMA Working Papers WP2012-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:eee:ejores:v:87:y:1995:i:1:p:65-73. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.