“…Given the difficulty in finding optimal solutions for large-scale scheduling problems, various metaheuristic algorithms have been constructed to obtain approximate solutions. Examples of such algorithms are genetic algorithm (GA) (Feng, Li, & Sethi, 2018), tabu search (Shen, Dauzère-Pérès, & Neufeld, 2018), simulated annealing (Kaplanoglu, 2016), harmony search (Maroosi, Muniyandi, Sundararajan, & Zin, 2016), scatter search (González, Vela, & Varela, 2015), and ant colony optimization (Rossi, 2014). Table 2 lists several references along with their contributions in relation to our work.…”