“…In literature, Meta-heuristic algorithms have been developed to solve PFSSP by several researchers. Most significant meta-heuristics used in literature are Artificial Bee Colony Algorithm (ABC) (Deng, Xu [35]; Han, Gong [36]; Li and Pan [37]; [38]), Differential Evolution Algorithm (DE) (Liu,Yin [39]), Evolutionary Algorithm (EA)(Qian, Wang [40], Yeh and Chiang [41]), Genetic Algorithms (GA) (Caraffa, Ianes [42]; Ruiz, Maroto [43]; Vallada and Ruiz [44]; Akhshabi, Haddadnia [45]; Andrade, Silva [46]), Hybrid Discrete Differential Evolution (HDDE)(Wang, Pan [47]), Hybrid Differential Evolution Algorithm (HDEA) (Liu,Yin [39]), Simulated Annealing (SA) (Laha and Chakraborty [48]; Lin and Ying [49]; Moslehi and Khorasanian [50]) Lin, Cheng [51], Tabu Search (TS)(Taillard [52]; Grabowski and Wodecki [53]; Grabowski and Pempera [54]; Arık [55]), TS and ABC (Li and Pan [37]), Hybrid Whale optimization algorithm(HWO) (Abdel-Basset, Manogaran [56]), Particle swarm optimization (PSO) (Zhao, Qin [57]) Evolution Strategy (ES) (de Siqueira, Souza [58]; Khurshid, Maqsood [59]), among others. These algorithms have found competitive results for different PFSSP's compared to heuristics; however, they require more computational time, as they initiate from a sequence that is constructed by heuristics and is iterated until termination criteria are achieved.…”