A hybrid heuristic for the unequal-area dynamic facility layout problem
by Artak Hakobyan; Alan McKendall
International Journal of Mathematics in Operational Research (IJMOR), Vol. 5, No. 6, 2013

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.

Online publication date: Mon, 31-Mar-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com