Research On The Optimization Methods Of Cellular Manufacturing Layout On Adding And Removing Machines

In today's market economy environment, the manufacturing industry market is changed from "the buyers'" to "the sellers'", which causes the "product-focus" mode of production to "customer-oriented". The manufacturing cellular layout is the advanced layout based on the cellular manufacturing system which gives consideration to high-efficient of mass production and the flexibility of one-piece production.Aiming at the features of the current factories, several key issues involved in the design of the widely cellular layout are studied on the base of adding/removing machines, including the modeling, algorithms design. In general, the full layout design requires two major steps: (1) Cell construction and intra-cell layout; (2) Cell system layout. The primary objectives in the formation and layout of manufacturing cell are concerned with minimizing the cost of logics and the number machines and maximizing the utilization of machines.Firstly, it studies the relationship among the alternative processing route, Cell construction and cell system layout based on reducing the material handling cost and relocation cost. Compared with those existing approaches, the proposed procedure attempts to solve cell formation, process planning and intra-cell layout in a single step, which improves the design quality and makes the problem's solving simpler. The formation of process is then developed, together with the corresponding GA-based algorithm for solving it. A comparison of the computational results with the existing methods indicates that the proposed approach is a viable r effective.Secondly, although the cell system layout problem is similar to a block layout problem in terms of concepts, models, and solution procedures, some definite differences between them make the cell system problem more complicated and thus, special issues need to be considered in the layout design. In this dissertation, an approach for solving the cell system layout problem is presented based on the spare distance code. The layout problem is modeled to achieve the process of GA satisfy. The computational results show that the proposed approach is capable of obtaining optimal solutions for the test problems even with a higher reduction of the objective function value as compared with other methods.Finally, based on the aforementioned techniques, the integrated design of the cell layout is developed, which can be used to make the layout designer's work easier. The running cases of the system are also given. A comparison of the computational results with the existing methods indicates that the proposed approach is a viable alternative for effectively generating layout designs. Besides, by some expended, the methods is also adapted to design the dynamic facitlity layout and the relocated process.