In today’s dynamic market, organizations must be adaptive to market fluctuations. In addition, studies show that material-handling cost makes up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearr...

natural frequency is one of the parameters that represent useful information about the dynamic behavior of structures. controlling this parameter can decrease the probability of damage under dynamic loading. weight optimization on layout and sizing with frequency constraints is a well known problem because of its highly non-linear behavior. improved ray optimization (iro) algorithm is utilized ...

A lot of Metaheuristics for solving dynamic combinatorial facility layout problems have been developed, but still require much computation time when the number of facilities or planning horizon is large. Dynamic facility layout should meet a dynamic change in both product mix and demand quantity of each product over a planning horizon by adjusting facility layout effectively under a given syste...

In early 2008 a new testing branch of the network analysis software visone has been made publicly available [Baur et al., 2008]. This realease includes the ability to process dynamic networks. A central feature is a dedicated dynamic layout algorithm which we present here from a methological and application oriented point of view. We first describe this algorithm from an algorithmic perspective...

While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the “mental map” between time-slices assists with the...

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...

Dynamic graph layout refers to the layout of graphs that change over time. These changes are due to user interaction, algorithms, or other underlying processes determining the graph. Typically, users spend a noteworthy amount of time to get familiar with a layout, i.e. they build a mental map ELMS91]. To retain this map at least partially, consecutive layouts of similar graphs should not diier ...