Scheduling Cellular Manufacturing Systems Using ACO and GA
2012 ◽
Vol 3
(1)
◽
pp. 48-64
◽
Keyword(s):
In this paper, cellular manufacturing scheduling problems are studied. The objective is to minimize makespan (Cmax) considering part family in the manufacturing cell flow line where the setup times are sequence dependent. Minimizing Cmax will result in the increment of output rate and the speed of manufacturing systems which is the main goal of such systems. This problem is solved using Ant Colony Optimization (ACO), Genetic Algorithm (GA) operators, and local search technique. To show the validity of proposed approach, it is compared with a tailor-made heuristic algorithm, called SVS. The obtained results indicate that the proposed method is quite fast and efficient.
1998 ◽
Vol 9
(6)
◽
pp. 561-571
◽
2004 ◽
Vol 15
(3)
◽
pp. 292-302
◽
2001 ◽
Vol 18
(8)
◽
pp. 591-597
◽
1988 ◽
Vol 110
(1)
◽
pp. 77-85
◽
2019 ◽
Vol 16
(3)
◽
pp. 1301-1314
◽
1993 ◽
Vol 25
(1-4)
◽
pp. 247-250
◽
2011 ◽
Vol 9
(2)
◽
pp. 202
◽
2011 ◽
Vol 49
(7)
◽
pp. 2123-2142
◽
2014 ◽
Vol 27
(1)
◽
pp. 30-57
◽