جلد 21، شماره 4 - ( 9-1389 )                   جلد 21 شماره 4 صفحات 197-209 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Motaghedi-larijani A, Sabri-laghaie K, Heydari M. Solving Flexible Job Shop Scheduling with Multi Objective Approach. IJIEPR. 2010; 21 (4) :197-209
URL: http://ijiepr.iust.ac.ir/article-1-237-fa.html
Solving Flexible Job Shop Scheduling with Multi Objective Approach. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1389; 21 (4) :197-209

URL: http://ijiepr.iust.ac.ir/article-1-237-fa.html


چکیده:   (5561 مشاهده)

  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 Pareto-optimal 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 .

     
نوع مطالعه: پژوهشي | موضوع مقاله: و موضوعات مربوط
دریافت: ۱۳۹۰/۲/۱۳

Cited by [2] [PDF 99 KB]  (134 دریافت)
ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb