Ant Colony Optimization approach for Job-shop Scheduling Problem

Ant Colony Optimization (ACO) is recently proposed as one of meta-heuristic methods for solving, hard combinatorial optimization problems.,,Job-shop Scheduling Problem (JSP) is to determine the, operation sequences on the machines for minimizing a makespan, and also has been confirmed as one of NP-hard problems. In this paper, an ACO approach for solving JSP is presented. We propose hybrid ACO that is combined other heuristic method to find good solution. The traditional heuristic methods include shortest processing time (SPT), longest processing time (LPT), shortest remaining time (SRT), longest remaining time (LRT), longest remaining time excluding the operation under consideration (LRM) for assigning priorities to the unscheduled operations is defined. Some numerical examples are demonstrated to show the performance of JSP using hybrid ACO.