Management Science
A parallel algorithm for the quadratic assignment problem
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Genetic search and the dynamic facility layout problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A simulated annealing algorithm for dynamic layout problem
Computers and Operations Research
Computers and Operations Research
Hybrid ant systems for the dynamic facility layout problem
Computers and Operations Research
Solving the truck and trailer routing problem based on a simulated annealing heuristic
Computers and Operations Research
Expert Systems with Applications: An International Journal
Short Communication: A note on the truck and trailer routing problem
Expert Systems with Applications: An International Journal
A simulated annealing heuristic for the dynamic layout problem with budget constraint
Computers and Industrial Engineering
Coupling simulation with heuristiclab to solve facility layout problems
Winter Simulation Conference
Design of robust layout for Dynamic Plant Layout Problems
Computers and Industrial Engineering
Single-Source Capacitated Multi-Facility Weber Problem-An iterative two phase heuristic algorithm
Computers and Operations Research
Robust scheduling on a single machine to minimize total flow time
Computers and Operations Research
Modelling and Simulation in Engineering
A simulated annealing heuristic for the truck and trailer routing problem with time windows
Expert Systems with Applications: An International Journal
Solving the design of distributed layout problem using forecast windows: A hybrid algorithm approach
Robotics and Computer-Integrated Manufacturing
Journal of Intelligent Manufacturing
Hi-index | 0.01 |
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 (SA I) is a direct adaptation of SA to the DFLP. The second SA heuristic (SA II) is the same as SA I 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.