“…The approaches used in solutions can be classified as exact solution and heuristic algorithms. To solve ASSP and TTFP, CPLEX solver ( 15 – 20 ), dynamic programming ( 21 – 26 ), and the branch and bound algorithm ( 27 – 29 ) have been applied as exact solution algorithms. In addition, several meta-heuristic algorithms have been implemented, such as the tabu search ( 16 , 27 , 30 , 31 ), simulated annealing ( 14 ), ( 32 – 35 ), ant colony optimization ( 36 – 38 ), the evolutionary algorithm ( 39 – 46 ), scatter search ( 47 ), particle swarm optimization ( 48 , 49 ), artificial bee colony ( 50 ), and artificial immune system ( 51 ).…”