Document Type
Article
Publication Date
2006
College/Unit
Statler College of Engineering and Mining Resources
Department/Program/Center
Industrial and Managements Systems Engineering
Abstract
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the problem of arranging and rearranging (when there are changes between the flows of materials between departments) manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized. This problem is known as the dynamic facility layout problem (DFLP). In this paper, two simulated annealing (SA) heuristics are developed for the DFLP. The first SA heuristic (SAI) is a direct adaptation of SA to the DFLP. The second SA heuristic(SAII) is the same as SAI with a look-ahead/look-back strategy added. To test the performance of the heuristics, a data set taken from the literature is used in the analysis. The results obtained show that the proposed heuristics are very effective for the dynamic facility layout problem.
Digital Commons Citation
McKendall, Alan; Shang, Jin; and Kuppusamy, Saravanan, "Simulated Annealing Heuristics for the Dynamic Facility Layout Problem" (2006). Faculty & Staff Scholarship. 3050.
https://researchrepository.wvu.edu/faculty_publications/3050