Solving Flexible Job Shop Scheduling with Multi Objective Approach
سال انتشار: 1389
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 864
فایل این مقاله در 13 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-21-4_003
تاریخ نمایه سازی: 7 شهریور 1393
چکیده مقاله:
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3)minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Paretooptimal solutions in a reasonable run time. The algorithm utilizes from a local search heuristic for improving the chance of obtaining more number of global Pareto-optimal solutions. The solution method uses from a perturbed global criterion function for guiding the search direction of the hybrid algorithm. Computational experiences show that the hybrid algorithm has superior performance in contrast to previous studies.
کلیدواژه ها:
Flexible jobshop scheduling ، Multi criteria decision making ، global programming ، Genetic algorithm ، Hill climbing
نویسندگان
Arash Motaghedi-larijani
Author is with the Department of Industrial Engineering, Iran University of science & technology , Narmak, Tehran, Iran
Kamyar Sabri-laghaie
Author with the same Department Tehran, Iran
Mahdi Heydari
Author is a Faculty at the same Department, Tehran, Iran