Solving Flexible Job-Shop Scheduling Problem using Hybrid Algorithm Based on Gravitational SearchAlgorithm and Particle Swarm Optimization
Publish place: Journal of Advances in Computer Research، Vol: 4، Issue: 3
Publish Year: 1392
نوع سند: مقاله ژورنالی
زبان: English
View: 542
This Paper With 14 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-4-3_006
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
Job Shop scheduling problem has significant importance in many researchingfields such as production management and programming and also combinedoptimizing. Job Shop scheduling problem includes two sub-problems: machineassignment and sequence operation performing. In this paper combination ofparticle swarm optimization algorithm (PSO) and gravitational search algorithm(GSA) have been presented for solving Job Shop Scheduling problem with criteria ofminimizing the maximal completion time of all the operations, which is denoted byMakespan. In this combined algorithm, first gravitational search algorithm findsbest mass with minimum spent time for a job and then particle swarm Optimizationalgorithm is performed for optimal processing all jobs. Experimental results showthat proposed algorithm for solving job shop scheduling problem, especially forsolving larger proble
Keywords:
Gravitational search algorithm , Particle Swarm Optimization algorithm , Flexiblejob shop scheduling
Authors
Behnam Barzegar
Department of Computer Engineering, Nowshahr Branch, Islamic Azad University, Nowshahr, Iran
Homayun Motameni
Department of Computer Engineering, Islamic Azad University, Sari Branch, Sari, Iran