Implementation of an Ant Colony Optimization technique for job shop scheduling problem

Abstract

Research on optimization of the job shop scheduling problem (JSP) is one of the most significant and promising areas of optimization. Instead of the traditional optimization method, this paper presents an investigation into the use of an Ant Colony System (ACS) to optimize the JSP. The main characteristics of this system are positive feedback, distributed computation, robustness and the use of a constructive greedy heuristic. In this paper, an improvement of the performance of ACS will be discussed. The numerical experiments of ACS were implemented in a small JSP. The optimized results of the ACS are favourably compared with the traditional optimization methods.