To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop layouts is needed to be developed. In this thesis, a heuristic algorithm for rectangular bay layouts in a flow shop situation is presented. The proposed algorithm is developed by using slicing tree representation and applied to various flow shop layout problems. The effectiveness of the proposed algorithm in terms of exploration rate and objective function value are shown by comparing our results to simulated annealing.