The Single Row Facility Layout Problem: State of the Art
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.
|Date of creation:||13 Dec 2011|
|Contact details of provider:|| Phone: 91 79 2630 7241|
Fax: 91 79 2630 6896
Web page: https://web.iima.ac.in/publications
More information through EDIRC
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.:
- 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.
- 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.
- 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.
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.