PSO and ACO Based Approach for Solving Combinatorial Fuzzy Job Shop Scheduling Problem
This paper proposes a prominent approach to solve job shop scheduling problem based on Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). The steps to generate the solution are grouped as planning, scheduling and optimization. Initially, fuzzy logic is applied for planning and then the scheduling stage is optimized using PSO and ACO. The processing order of jobs for each machine is scheduled with an objective to find a feasible plan that minimizes the make-span, completion time and waiting time. The well known Fisher and Thompson 10x10 instance (FT10) and Adams, Balas, and Zawack 10x10 instance (ABZ10) problems are selected as the experimental benchmark problems.