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 sum of the material handling and rearrangement costs are minimized. This probl...

This paper experiments application of different heuristic approaches to a real facility layout problem at a furniture manufacturing company. All the models are compared using AHP, where a number of parameters of interest are employed. The experiment shows that formal layout modelling approaches can be effectively used real problems faced in industry, leading to significant improvements.

Today’s consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. In addition, studies show that material handling cost make up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearrangin...

The dynamic single row facility layout problem (DSRFLP) is defined as the of arranging facilities along a straight line during multi-period planning horizon with objective minimizing sum material handling and rearrangement costs. cost products flow costs center-to-center distances between facilities. In this paper, we focus on metaheuristic algorithms for problem. main contributions paper are t...

Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....

Much of the research in facility layout has focused on static layouts where the material handling flow is assumed to be constant during the planning horizon. But in today’s market-based, dynamic environment, layout rearrangement may be required during the planning horizon to maintain layout effectiveness. A few algorithms have been proposed to solve this problem. They include dynamic programmin...

This paper presents an algorithm for solving a multi-floor facility layout problem. The most apparent difference and also the potential difficulty in a multi-floor facility layout problem, compared to a single floor facility layout problem, are the problems regarding the placement of the vertical transportation equipments (elevators), which are to be used for vertical transportation occuring wi...