ACO ALGORITHMS FOR THE SCHEDULING MIXED-MODEL ASSEMBLY LINES

摘要

Solving the mixed-model scheduling problem is the mostrnimportant goal for Just-in-time production systems. Thernmain desirable characteristics of ant algorithm are versatile,rnrobust and parallel searching. This paper presents a novel cooperativernagents approach, ant colony optimizationrnalgorithm (ACO) scheme, for solving the scheduling mixedmodelrnassembly lines. The results show that the solutionrnwhich ant algorithm produces is better than the one Toyota’srnGoal Chasing Algorithm, Simulated annealing algorithm andrnGA.