Ant Colony Job Shop Scheduling Optimization

The Job shop scheduling problem is considered as an important industrial activity, especially in production planning. The objective of minimizing the maximum of the completion time is called (Makespan). The job shop scheduling considers as strongly nondeterministic polynomial-time hard named as (NP-HARD). Many methods were developed, including the Ant Algorithm to solve this problem. In this paper is used Multiple Ant colony Algorithm to solve Job Shop Scheduling, many specific features are introduced in the algorithm in order to improve the efficiency of the search. Local Pheromone update with max and min updated are used for all Ant colonies. The proposed algorithm is tested over a set of benchmark instances available in the OR-Library and give the optimal or near to optimal solution.

کلیدواژه ها:

Job-shop scheduling problem ، Multiple Ant Colony algorithm ، Local Pheromone update ، Max & Min Pheromone update