A hybrid heuristic for the unequal-area dynamic facility layout problem

Artak Hakobyan and Alan McKendall

International Journal of Mathematics in Operational Research, 2013, vol. 5, issue 6, 743-763

Abstract: The dynamic facility layout problem (DFLP) is the problem of finding positions of departments on the plant floor for a multi-period planning horizon such that departments do not overlap, and the sum of the material handling and rearrangement costs is minimised. In this paper, the departments may have unequal-areas and can be placed anywhere within the boundary of the continuous plant floor. Because of the complexity of the problem, only small-size problems can be solved in reasonable time using exact methods. As a result, a hybrid heuristic, which consists of a dual simplex method and a tabu search (TS) heuristic, is developed for the DFLP, and the heuristic was tested on some instances from the literature. The results obtained demonstrate the effectiveness of the heuristic.

Keywords: facilities planning; facilities design; dynamic facility layout problem; DFLP; unequal area departments; hybrid heuristics; tabu search; dual simplex; materials handling costs; rearrangement costs. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=57492 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:5:y:2013:i:6:p:743-763

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().