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

Parvati techno cast (Guj) pvt. ltd. (688, GIDC estate Makarpura, Vadodara, 390010) is the company which manufacture different mechanical components (100gm to 200kg weight) by using casting. Also manufacturing engineering services include machining of components which are produced by casting. At present situation company is having less productivity due to ineffective utilization of plant layout,...

A single row machine layout problem is studied with zoningconstraints and mutual clearances under an enhanced objective ofminimizing material flow cost installation cost. The isrestricted by positive negative zoning constraints to represent reallife problems. Moreover, needed between pairs aredivided in two types, which are must extra clearances, extraclearances reduced use adjacent machines to...

This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required to cut the blocks into pieces. Firstly vertical cuts divide the stock sheet into segments, and then horizontal cuts divide the segments into ...

In this paper, issues of storage layout and order picking operations problems for warehousing are addressed using optimization techniques. The aim of this study is to develop a dynamic planning system applied for storage layout and order-picking operations problems. The planning system considers dynamic nature of customer order demand, configuration of picking area, and interactive human-machi...

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