MULTIPLE-RULE BASED GENETIC ALGORITHM FOR SIMPLE ASSEMBLY LINE BALANCING PROBLEMS (MRGA-SALBP-I)
Adil Baykasoğlu1, Lale Özbakır2, M. Burak Telcioğlu2
1University of Gaziantep, Department of Industrial Engineering, 27310, Gaziantep, TURKEY
2Erciyes University, Department of Industrial Engineering, 38039, Kayseri, TURKEY
email@example.com, firstname.lastname@example.org, email@example.com
The task of balancing of assembly lines is of considerable industrial importance. It consists of assigning operations to workstations in a production line in such a way that (1) no assembly precedence constraint is violated, (2) no workstations in the line takes longer than a predefined cycle time to perform all the tasks assigned to it, and (3) as few workstations as possible are needed to perform all the tasks in the set. This paper presents a new genetic algorithm for the simple assembly line balancing problems with the aim of minimizing the number of workstations. However, the objective function of the proposed algorithm can also consider the idle times in each formed workstation. The proposed algorithm is tested and compared with 25 literature test problems in different cycle times. The proposed algorithm found the optimal solutions for each problem in short computational times.
Keywords: Assembly Line Balancing, Genetic Algorithms, and Priority Rules.