University of IsfahanTransactions on Combinatorics2251-865711120220301An effective new heuristic algorithm for solving permutation flow shop scheduling problem15272541910.22108/toc.2021.126406.1795ENShahriarFarahmand RadDepartment of Mathematics, Payame Noor University of ABCD, P.O.Box 19395-3697, Tehran, IranJournal Article20201210The deterministic permutation flow shop scheduling problem with makespan criterion is not solvable in polynomial time. Therefore, researchers have thought about heuristic algorithms. There are many heuristic algorithms for solving it that is a very important combinatorial optimization problem. In this paper, a new algorithm is proposed for solving the mentioned problem. The presented algorithm chooses the weighted path that starts from the up-left corner and reaches the down-right in the matrix of jobs processing times and calculates the biggest sum of the times in the footprints of this path. The row with the biggest sum permutes among all the rows of the matrix for locating the minimum of makespan. This method was run on Taillard’s standard benchmark and the solutions were compared with the optimum or the best ones as well as 14 famous heuristics. The validity and effectiveness of the algorithm are shown with tables and statistical evaluation.https://toc.ui.ac.ir/article_25419_e602a948cb2cd8fdf03ff1639a347014.pdf