.png){kind=icon}
.png){kind=icon}
Return
Efficient algorithm for cell formation with sequence data, machine replications and alternative process routings
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540310001652914.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cell formation is an important problem in the design of a cellular manufacturing system. Despite a large number of papers on cell formation being published, only a handful incorporate operation sequence in intercell move calculations and consider alternative process routings, cell size, production volume and allocating units of identical machines into different cells. Modelling the above factors makes the cell formation problem complex but more realistic. The paper develops a model and solution methodology for a problem of cell formation to minimize the sum of costs of intercell moves, machine investment and machine operating costs considering all the factors mentioned above. An algorithm comprised of simulated annealing and local search heuristics has been developed to solve the model. A limited comparison of the proposed algorithm with an optimal solution generated by complete enumeration of small problems indicates that the algorithm produces a solution of excellent quality. Large problems with 100 parts and 50 machine types are efficiently solved using the algorithm.
Keywords:
GROUP-TECHNOLOGY
MANUFACTURING SYSTEMS
IDENTICAL MACHINES
DESIGN
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available