Abstract

One of the most important stages in the establishment of a cellular manufacturing system is the formation of manufacturing cells in order to find out which machines dedicated to each cell and part families corresponding to these machines. In this paper, two kinds of cells are being considered: (1) general or common cells which are able to manufacture different kinds of products and (2) specific cells which are able to manufacture a specific type of product. To set up cells for manufacturing, two kinds of capital constraints are observed: (1) capital constraints for construction and formation of cells and (2) capital availability constraints for the provision of tools and equipment to manufacture corresponding commodities. To find cells and to specify the family of the assigned commodities to each cell, different and various criteria exist. In this paper, three criteria are taken into consideration simultaneously in order to minimize the sum of: (1) costs of the delay in delivering a product to costumers by the above two cells in each period, (2) costs of the common and specific cells to remain idle in each period and (3) the unused capital. Since the cell formation problem is mostly time consuming, i.e. these are NP-hard, then to solve the problem, an effective algorithm of simulated annealing (SA) method is utilized. To verify and validate the efficiency of the SA algorithm, from the standpoint of the quality of the solution obtained and time of calculations, the results obtained are compared with those of the Lingo 6 software. Results suggest that the SA algorithm have good ability of solving the problem, especially in the case of large-sized problems for which Lingo 6 cannot produce solutions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call