An efficient simulated annealing algorithm for a No-Wait Two Stage Flexible Flow Shop Scheduling Problem
M. Rabiee1 , P. Ramezani2 and R. Shafaei3
1 Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran
2Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran
3 Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran
ABSTRACT
In this paper, no wait two stage flexible flow shop scheduling problem (FFSSP) is solved using two metaheuristic algorithms. This problem with minimum makespan performance measure is NP-Hard. The proposed algorithms are Simulated Annealing and Genetic Algorithm. The results are analyzed in terms of Relative Percentage Deviation of Makespan. The performance of the proposed algorithms are studied and compared with that of MDA algorithm. For this propose a number of problems in different sizes are solved. The results of the studies proposes the effective algorithm. This is followed by describing the outline of the study, concluding remarks and suggesting potential areas for further researches
KEYWORDS:
No wait, Two stage, Flexible flow shop, Makespan, Simulated annealing, Genetic algorithm. .
Pdf URL:
.png)
No comments:
Post a Comment