The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facility layout problem is a hard problem, and therefore, exact solution methods are only feasible for small or greatly restricted problems. In this paper, we propose a spring-embedding approach that unlike previous approache...

This paper presents a facility for definition and management of federated clusters of interrelated information. In a co-working environment, team members need to exchange information in order to coordinate their tasks execution, where typically the information is distributed over several cooperating autonomous systems. The co-working facility described in this paper supports the sharing and exc...

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based ...

A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...

This paper applies genetic optimization with an adaptive penalty function to the shapeconstrained unequal area facility layout problem. We implement a genetic search for unequal area facility layout, and show how optimal solutions are affected by constraints on permitted department shapes, as specified by a maximum allowable aspect ratio for each department. We show how an adaptive penalty func...

This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans-Beckmann variant of the Quadratic Assignment Problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German university hospital, Klinikum Regensburg. This problem, known as the Krarup30a upon its inclusion in the ...

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...

My research field is Computational Geometry, and I am interested both in theoretical problems and in ‘real life’ applications. This statement includes a summary of my research work to date. The first part covers work involving L1 shortest paths, center point and obnoxious facility location (see [5], [6], [8]) most of this work was done during my Master studies [1999-2001], and is motivated by p...

This research focused on using design of experiments (DoE) and simulation modeling to optimize the facility layout in a server assembly line, while introducing a new product. The critical factors that impact the performance metrics of cycle time, work-in-process and throughput were identified by using DoE principles. Subsequently, simulation modeling was used to evaluate the various what-if sce...