Advanced Search
MyIDEAS: Login

The Single Row Facility Layout Problem: State of the Art

Contents:

Author Info

  • Kothari, Ravi
  • Ghosh, Diptesh

Abstract

The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lenghs on a line so as to minimize the weighted sum of the distances between all the pairs of facilities. The SRFLP and its special cases often arise while modeling a large variety of applications. It was actively researched until the mid-nineties. It has again been actively studied since 2005. Interestingly, research on many aspects of this problem is still in the initial stages, and hence the SRFLP is an interesting problem to work on. In this paper, we review the literature on the SRFLP and comment on its relationship with other location problems. We then provide an overview of different formulations of the problem that appear in the literature. We provide exact and heuristic approaches that have been used to solve SRFLPs, and finally point out research gaps and promising directions for future research on this problem.

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: http://www.iimahd.ernet.in/assets/snippets/workingpaperpdf/7736113342011-12-02.pdf
File Function: English Version
Download Restriction: no

Bibliographic Info

Paper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number WP2011-12-02.

as in new window
Length:
Date of creation:
Date of revision:
Handle: RePEc:iim:iimawp:11005

Contact details of provider:
Phone: 91 79 2630 7241
Fax: 91 79 2630 6896
Web page: http://www.iimahd.ernet.in/publications
More information through EDIRC

Related research

Keywords:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. 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.
  2. 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.
  3. 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.
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 in new window

Cited by:
  1. Kothari, Ravi & Ghosh, Diptesh, . "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.
  2. Kothari, Ravi & Ghosh, Diptesh, . "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.
  3. Kothari, Ravi & Ghosh, Diptesh, . "A Lin-Kernighan Heuristic for Single Row Facility Layout," IIMA Working Papers WP2012-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:iim:iimawp:11005. 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: ().

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.