TY - JOUR N2 - This paper explores selected heuristics methods, namely CDS, Palmer’s slope index, Gupta’s algorithm, and concurrent heuristic algorithm for minimizing the makespan in permutation flow shop scheduling problem. Its main scope is to explore how different instances sizes impact on performance variability. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation, while outputs of the NEH algorithm were used as reference solutions for comparison purposes. Finally, pertinent findings are commented. L1 - http://www.czasopisma.pan.pl/Content/113113/PDF/5-276.pdf L2 - http://www.czasopisma.pan.pl/Content/113113 PY - 2019 IS - No 3 DO - 10.24425/mper.2019.129598 KW - Benchmarking KW - flow shop KW - makespan KW - relative percent deviation KW - heuristics A1 - Soltysova, Zuzana A1 - Semanco, Pavol A1 - Modrak, Jan PB - Production Engineering Committee of the Polish Academy of Sciences, Polish Association for Production Management VL - vol. 10 DA - 26.09.2019 T1 - Exploring heuristic techniques for flow shop scheduling UR - http://www.czasopisma.pan.pl/dlibra/publication/edition/113113 T2 - Management and Production Engineering Review ER -