Presented in this paper is an heuristic algorithm to solve the problem of facilities design. As in other construction algorithms, facilities are picked up one by one and assigned to suitable locations. Facility i is assigned to location j by analysing the menu and the standard deviation of the total cost of all feasible layouts associated with the assignment. The location which minimizes the expected minimum assignment cost is selected for assigning a particular facility. Preliminary investigations have indicated the superiority of the proposed method over many of the existing techniques.