Solving job shop scheduling problem with Ant Colony Optimization

Job Shop Scheduling Problem (JSSP) is one of the important and tough problem in real world, which tries to schedule N jobs to be performed on M machines. In this paper, it is aimed to imply this problem in computer science and also bringing up many related solution models. Although, most of these models try to find an optimal approach, Ant Colony Optimization (ACO) constitutes the optimal solution by using some of the complex ACO scenarios effectively. In this study, it is focused on one of the scenario of the JSSP and explained in which steps are used in the ACO solution. With simulation study, it is aimed to show, how ACO copes with the JSSP clearly.