A new approach to the cell formation problem with alternative processing routes and operation sequence |
| |
Authors: | Maghsud Solimanpur Ahad Foroughi |
| |
Affiliation: | 1. Faculty of Engineering , Urmia University , Urmia, Iran m.solimanpur@urmia.ac.ir;3. Department of Industrial Engineering , Azad University , Arak, Iran |
| |
Abstract: | Cellular manufacturing (CM) is an important application of group technology in manufacturing systems. One of the crucial steps in the design of CM is the identification of part families and manufacturing cells. This problem is referred to as cell formation problem (CFP) in the literature. In this article, a solution approach is proposed for CFP, which considers many parameters such as machine requirement, sequence of operations, alternative processing routes, processing time, production volume, budget limitation, cost of machines, etc. Due to the NP-hardness of CFP, it cannot be efficiently solved for medium- to large-sized problems. Thus, a genetic algorithm (GA) is proposed to solve the formulated model. Comparison of the results obtained from the proposed GA to the globally optimum solutions obtained by Lingo Software and those reported in the literature reveals the effectiveness and efficiency of the proposed approach. |
| |
Keywords: | cellular manufacturing cell formation problem alternative routes mathematical programming |
|
|