Job Shop Scheduling Problem menggunakan Ant Colony Optimization dan Algoritme Genetika

Aulia, Rizka
Aprilisa, Shinta

Jurnal Teknik Industri Terintegrasi (JUTIN)
Vol. 7 No. 3 (2024): July

Problem (JSSP) is a problem to determine the sequence of operations carried out on existing machines with the aim of minimizing the total processing time required. The development of optimization methods to achieve solutions to machine operation sequence problems has encouraged the emergence of many new solution methods. This research wants to compare two solution methods using Ant Colony Optimization (ACO) and Genetic Algorithms. The two methods are compared to find out which optimization is best used to solve the JSSP problem. The results of this research show that the ACO algorithm is better with mean squared error of 72.99%, compared to the Genetic Algorithm with mean squared error of 11.71%.