“…On the other hand, metaheuristics were applied to generalized scheduling problems [24,4,28,37,32,25,38,18,26,7,2,30,33,16,40]. Increasing studies about soft computing techniques or metaheuristics based on Monte Carlo methods, such as genetic algorithm and ACO, were due to the NP hardness of the combinatorial problems.…”