Volume 21, Issue 4 (IJIEPR 2010)                   IJIEPR 2010, 21(4): 197-209 | Back to browse issues page

XML 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-en.html
1- A. Motaghedi-larijani, Author is with the Department of Industrial Engineering, Iran University of science & technology , Narmak, Tehran, Iran
2- Author with the same Department Tehran, Iran
3- Author is a Faculty at the same Department, Tehran, Iran , Mheydari@iust.ac.ir
Abstract:   (11807 Views)

  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 .

Full-Text [PDF 419 kb]   (7616 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2011/05/3 | Published: 2010/12/15

Cited by [2] [PDF 99 KB]  (654 Download)
Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.