A new method for solving flow shop scheduling systems using a combination of genetic algorithm and tabu search

The Flow-shop scheduling is a schedule planning for large volume systems with very less variations in requirements. In flow-shop scheduling problem(FSSP) environment, the objective of this paper is to find an optimal schedule ordering of M machines for the N jobs for Flow shop problem using genetic algorithm approach (GA) and tabu search algorithm(TS).In other words, flowshop scheduling problem with the objective of minimising the makespan is proposed. Experimental results show that the proposed algorithm for small and medium-sized test data with genetic algorithms achieves similar questions, But the big test data to achieve better results than GA, Because of the use of tabu search algorithm with genetic algorithm.

کلیدواژه ها:

Genetic Algorithm (GA) ، Flow Shop Scheduling (FSS) ، Flow Shop Scheduling Problem (FSSP) ، Tabu search algorithm (TS)