PSO & ASO Based approach for solving Combinational fuzzy job shop scheduling problem
Titel:
PSO & ASO Based approach for solving Combinational fuzzy job shop scheduling problem
Auteur:
Surekha P Dr.S.Sumathi
Verschenen in:
International journal of computer technology and applications
Paginering:
Jaargang 02 (2011) nr. 01 pagina's 112-120
Jaar:
2011
Inhoud:
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 makespan, 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. The results of the applied optimization techniques are compared with the computed parameters like makespan, waiting time, completion time and elapse time. The performance evaluation of optimization techniques are analysed for both benchmark problems and the PSO technique is found superior. Keywords – Planning, Scheduling, makespan, completion time, waiting time, particle swarm optimization, ant colony optimization.
Tijdschrift beschrijving