Layout problems belong to NP-Complete problems theoretically. They are concerned more and more in recent years and arise in a variety of application fields such as the layout design of spacecraft modules, plant equipments, platforms of marine drilling well, shipping, vehicle and robots. The algorithms based on swarm intelligence are relatively effective to solve these kind of problems. But usua...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.

This paper deals with dynamic facility layout problem (DFLP) in a plant which is concerned determining the best position of machines during multi-period planning horizon. The material handling costs and rearrangement (MRC) are used to determine layout. In addition positions machines, details transportation such as type transporters sequence operations have direct effect on (MHC). Therefore, it ...

Abstract Choosing the right method for planning a mini-plant layout with most efficient material handling is crucial to minimize its cost of production. This study aims create design soy concentrate-based high protein biscuit mini factory, as well evaluate financial feasibility factory design. Layout generation methods used in this were Systematic Planning and BLOCPLAN algorithm. The efficiency...

 This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...