An efficient simulated annealing algorithm for a No-Wait Two Stage Flexible Flow Shop Scheduling Problem

摘要

In this paper, no wait two stage flexible flow shop scheduling problem (FFSSP) is solved using two meta-heuristic 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