Relationships among SFLP, DFLP and Robust Layout

2007 ◽  
Vol 10-12 ◽  
pp. 235-241
Author(s):  
Xiao Hong Suo ◽  
Zhan Qiang Liu
Keyword(s):  
Manufacturing Systems ◽  
Facility Layout ◽  
Performance Characteristics ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Research Results ◽  
Dynamic Facility Layout Problem ◽  
The Difference

Facility layout plays an important role in the performance of manufacturing systems. Firstly, this paper describes the derivations and classification of facility layout problem (FLP). The concepts of static facility layout problem (SFLP), dynamic facility layout problem (DFLP) and robust layout problem are introduced, and their main performance characteristics are compared with each other. Then, the procedure of rearrangement costs in DFLP is proposed. Some main characteristics of SFLP and DFLP, DFLP and robust layout are compared respectively. Lastly, the difference and connection among SFLP, DFLP and robust layout are analyzed. The research results indicate that the dynamic facility layout and robust layout are suitable for the dynamic and changeable manufacturing systems. The method for development of DFLP and its implementation are presented based on SFLP and robust layout.

DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES

2014 ◽  
Vol 31 (04) ◽  
pp. 1450027 ◽  
Author(s):  
GARY YU-HSIN CHEN ◽  
JU-CHIEH LO
Keyword(s):  
Quadratic Assignment Problem ◽  
Facility Layout ◽  
Quadratic Assignment ◽  
Data Sets ◽  
Multiple Time ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Multi Objective

A problem in multi-objective dynamic facility layout is achieving distance- and adjacency-based objectives for arranging facility layouts across multiple time periods. As a non-deterministic polynomial time-hard problem, it resembles the quadratic assignment problem (QAP), which can be solved through meta-heuristics such as ant colony optimization (ACO). This study investigates three multi-objective approaches coupled with ACO to solve this problem. As the experimental design, we apply the proposed methods to solve the dynamic facility layout problem (DFLP), multi-objective facility layout problem, and multi-objective DFLP based on data sets from the literature to test the quality of the solution. The results show that the proposed methods are effective for solving the problem.

scholarly journals Genetic algorithm using a modified backward pass heuristic for the dynamic facility layout problem *

2011 ◽  
Vol 2 (3) ◽  
Author(s):  
Kazi Shah Nawaz Ripon ◽  
Kyrre Glette ◽  
Dirk Koch ◽  
Mats Hovin ◽  
Jim Torresen
Keyword(s):  
Genetic Algorithm ◽  
Material Handling ◽  
Manufacturing System ◽  
Industrial Robot ◽  
Facility Layout ◽  
Layout Problem ◽  
Facility Layout Problem ◽  
Dynamic Facility Layout Problem ◽  
Economical Consideration ◽  
Over Time

AbstractLayout planning in a manufacturing company is an important economical consideration. In the past, research examining the facility layout problem (FLP) generally concerned static cases, where the material flows between facilities in the layout have been assumed to be invariant over time. However, in today’s real-world scenario, manufacturing system must operate in a dynamic and market-driven environment in which production rates and product mixes are continuously adapting. The dynamic facility layout problem (DFLP) addresses situations in which the flow among various facilities changes over time. Recently, there is an increasing trend towards implementation of industrial robot as a material handling device among the facilities. Reducing the robot energy usage for transporting materials among the facilities of an optimal layout for completing a product will result in an increased life for the robots and thus enhance the productivity of the manufacturing system. In this paper, we present a hybrid genetic algorithm incorporating jumping genes operations and a modified backward pass pair-wise exchange heuristic to determine its effectiveness in optimizing material handling cost while solving the DFLP. A computational study is performed with several existing heuristic algorithms. The experimental results show that the proposed algorithm is effective in dealing with the DFLP.

Sign in / Sign up

Export Citation Format

Share Document