A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time
Publish place: Journal of Advances in Computer Research، Vol: 3، Issue: 4
Publish Year: 1391
نوع سند: مقاله ژورنالی
زبان: English
View: 724
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACR-3-4_002
تاریخ نمایه سازی: 16 شهریور 1395
Abstract:
Proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. One of the most important and complicatedscheduling problems is open shop scheduling problem. There are n jobs in openshop scheduling problem which should be processed by m machines. Purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified machines so that makespan can be minimized. Open shop schedulingproblem has very large and complex solution space and so is one of NP-Problems.Till now, different algorithms have been presented for open shop schedulingproblem. In this paper, we have used combined genetics algorithm as a strategy forsolving scheduling open shop problem and compared proposed algorithm with DGAalgorithm. Results show that the proposed algorithm has better effectiveness thanDGA algorithm.
Keywords:
Authors
Behnam Barzagar
Department of Computer Engineering, Nowshahr Branch, Islamic Azad University, Nowshahr, Iran
Homayun Motameni
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran
Ali Khosrozadeh Ghomi
Department of Computer Engineering, Science and Research Ayatollah Amoli Branch, Islamic AzadUniversity, Amol, Iran
Azadeh Divsalar
Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran