Management Science
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
A heuristic algorithm for machine assignment in cellular layout
Computers and Industrial Engineering
Ant Colony Optimisation for Machine Layout Problems
Computational Optimization and Applications
A genetic algorithm for facility layout problems of different manufacturing environments
Computers and Industrial Engineering
Simulated annealing heuristics for the dynamic facility layout problem
Computers and Operations Research
Hybrid ant systems for the dynamic facility layout problem
Computers and Operations Research
A continuous approach to considering uncertainty in facility design
Computers and Operations Research
Information Sciences: an International Journal
Engineering Applications of Artificial Intelligence
Super facilities versus chaining in mitigating disruptions impacts
Computers and Industrial Engineering
Hi-index | 0.00 |
In this paper, a design for robust facility layout is proposed under the dynamic demand environment. The general strategy for a multi period layout planning problem is adaptive approach. This approach for Dynamic Plant Layout Problem (DPLP) assumes that a layout will accommodate changes from time to time with low rearrangement and production interruption costs, and that the machines can be easily relocated. On the other hand the robust layout approach, assumes that rearrangement and production interruption costs are too high and hence, tries to minimize the total material handling costs in all periods using a single layout. Robust approach suggests a single layout for multiple scenarios as well as for multiple periods. As a solution procedure for the proposed model, a Simulated Annealing (SA) algorithm is suggested, which perform well for the problems from literature and QAPLIB website. The application of suggested model for robust layout to cellular layouts has given better results compared to the robust cellular layout model of literature. For the standard DPLP of the literature, the solution values of the suggested model are very near to the results of adaptive approach. The Total Penalty Cost (TPC) is used to test the suitability of the suggested layout to be a robust layout for the given data set. TPC values indicate that the suggested layout is suitable as robust layout for the given data sets.