Machine cell formation using simulated annealing algorithm in cellular manufacturing system
by A. Adinarayanan; M. Uthayakumar; G. Prabhakaran
International Journal of Computer Aided Engineering and Technology (IJCAET), Vol. 10, No. 1/2, 2018

Abstract: Group technology is a production strategy and it has the ability to get solution for certain problems of complexity and long manufacturing lead times in batch manufacturing. This can be achieved by using a systematic method of equipments into machine cells and components into part families, based on the suitable similarity criteria. The present work deals with the machine cell formation problem with the aim of minimising the aggregate cell load variation and aggregate inter cellular move. The quantity of parts, operation sequences, processing time, capacity of machines, and workload of machineries were considered as parameters. In order to group the machineries, one of the metaheuristic search methodologies the simulated annealing (SA) algorithm is considered. For computational processing 40 machines and 100 part types are being used. From the findings it is observed that, in most of the literature problems SA provides better result than that of other methods in the literature and in few cases it yields equal result to the best one of the other methods.

Online publication date: Wed, 20-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Aided Engineering and Technology (IJCAET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email