Alan R. McKendall

TL;DR: This paper considers the problem of arranging and rearranging manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized and develops two simulated annealing heuristics for the dynamic facility layout problem.

TL;DR: In this article, hybrid ant systems (HASs) are developed to solve the dynamic facility layout problem (DFLP), and the results show that the HASs are efficient techniques for solving the DFLP.

TL;DR: A boundary search (construction) technique, which places departments along the boundaries of already placed departments, is developed for the DFLP and improved using a tabu search heuristic, demonstrating the effectiveness of the heuristics.

TL;DR: In this paper, three tabu search (TS) heuristics are presented for the dynamic facility layout problem (DFLP), which is defined as the problem of assigning departments to locations during a multi-period planning horizon such that the sum of the material handling and re-arrangement costs is minimised.

TL;DR: Construction algorithms and a tabu search heuristic are presented for the dynamic space allocation problem and a set of test problems taken from the literature is used to test the performances of the heuristics.