Solving open shop scheduling problem using Genetic Algorithm

Publish Year: 1394
نوع سند: مقاله ژورنالی
زبان: English
View: 646

This Paper With 6 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJMEC-5-14_013

تاریخ نمایه سازی: 16 فروردین 1395

Abstract:

This paper considers the scheduling problem of open shop to minimize makespan. Purpose of scheduling open shop problem is attaining to a suitable order of processing n jobs by m specified machines such that makespan be minimized. Open shop scheduling problem has very large and complex solution space and so is one of NP-Problems. Up till now, different algorithms have been presented for open shop scheduling problem. In this paper we use Genetic Algorithm (GA) as a strategy for solving the scheduling open shop problem and the results show better effectiveness in some instances of proposed algorithm compared with other algorithm

Authors

Alireza Ghoonodi

Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran