Penerapan Algoritma Consultant-Guided Search Dalam Masalah Penjadwalan Job Shop Untuk Meminimasi Makespan

This research uses the Consultant-Guided Search (CGS) algorithm to solve job shop schedulingproblems minimizing makespan. CGS is a metaheuristics inspired by people making decisionsbased on consultant's recommendations. A number of cases from literatures is developed to evaluatethe optimality of this algorithm. CGS is also tested against other metaheuristics, namely GeneticAlgorithms (GA) and Artificial Immune Systems (AIS) for the same cases. Performance evaluationsare conducted using the best makespan obtained by these algorithms. From computational results,it is shown that CGS is able to find 3 optimal solutions out of 10 cases. Overall, CGS performs bettercompared to the other algorithms where its solution lies within 0 - 6,77% from the optimal solution,averaging only 2,15%. Futhermore, CGS outperforms GA in 7 cases and performs equally well inthe other 3 cases. CGS is also better than AIS in 8 cases and is equally well in only 2 cases