an improved tabu search algorithm for job shop scheduling problem trough hybrid solution representations

Job shop scheduling problem (jsp) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. due to np-hardness property of this problem, many meta-heuristics are developed to solve it. solution representation (solution seed) is an important element for any meta-heuristic algorithm. therefore, many researchers try to present different encodings to solve this problem. fattahi et al., and gen & cheng suggested two solutions for this problem that both have advantages and weaknesses in searching solution space to reach an acceptable solution. in the current paper, a cyclic algorithm based on tabu search algorithm was proposed to improve the exploration and exploitation powers of these encodings. also, several problems of different sizes are solved by it and the obtained results were compared. results showed the applicability and effectiveness of the proposed solution representation in comparison with the existing ones.