Minimizing Non-decreasing Objective Functions for the Open Shop Scheduling Problem Using Genetic Algorithm

Planning is currently considered as an important element for the whole personal¡ societal and organizational affairs¡ whereby every activity would be performed effectively. Scheduling is of high significance in operations research. Recently¡ scholars have drawn much attention to the application of mathematical modeling as an optimization approach in solving the complex scheduling problems. However¡ only a few have addressed the open-shop scheduling problem. This study was intended to investigate the effectiveness of meta-heuristic genetic algorithm in order to minimize non-decreasing separable objective functions for such problem. In this genetic algorithm¡ displacement mutation and partially matched crossover were adopted as two operators. Moreover¡ the obtained solutions were compared based on how to select the best chromosome by using methods of tournament selection¡ rank selection¡ and roulette wheel selection. The data were collected through literature review. It was exhibited that meta-heuristic genetic algorithm can rapidly find the optimal solution. Furthermore¡ rank selection resulted in more optimal solutions instead of the other two.