TO SOLVE THE OPEN SHOP SCHEDULING PROBLEMS WITH THE PARALLEL KANGAROO ALGORITHM

The open shop scheduling problem is essentially a sort of scheduling problem that each job has only one operation to be processed on each machine and the processing order is not significant. it has been mainly encountered in a facility that is manufacturing similar types of products groups. in this study, open shop scheduling problems were solved in order to minimize the total make-span with parallel kangaroo algorithm which runs by the random jumping method. parallel kangaroo algorithm is a meta-heuristic algorithm which continuously tries to reach the better solutions. the open shop scheduling instances for the benchmarking in the literature were solved with a kangaroo algorithm in which the wild and the tame kangaroo operators are operated in a parallel manner. the yielded results were compared with the best results in the literature. it has been found the performance of the parallel kangaroo algorithm for solving the open shop scheduling problems was efficient.