Volume 21, Issue 4 (IJIEPM 2011)                   2011, 21(4): 179-190 | Back to browse issues page

XML Persian Abstract Print


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

Fasihi M, Jolai F, Tavakkoli-Moghaddam R. Minimizing the Maximum Tardiness on an m-Machine reentrant Permutation Flowshop Problem. Journal title 2011; 21 (4) :179-190
URL: http://ijiepm.iust.ac.ir/article-1-515-en.html
, fjolai@ut.ac.ir
Abstract:   (8785 Views)

  This investigation considers a reentrant permutation flowshop scheduling problem whose performance criterion is maximum tardiness. The reentrant flowshop (RFS) is a natural extension of the classical flowshop by allowing a job to visit certain machines more than once. The RFS scheduling problem, in which the job order is the same for each machine in each layer, is called a reentrant permutation flowshop (RPFS) problem. In this paper, a mathematical model is extended to solve the given problem minimizing the maximum tardiness on an m-machine RPFS problem. This problem is solved by three meta-heuristic algorithms, namely genetic algorithm, simulated annealing and tabu search. The results of these algorithms are compared to the optimal solutions obtained by the integer programming approach. The experimental results show that the genetic algorithm has a better performance than the others tested .

Full-Text [PDF 579 kb]   (2364 Downloads)    

Add your comments about this article : Your username or Email:
CAPTCHA

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.