from the conferences organized by TANGER Ltd.
One of the most popular algorithms for solving the permutation flow shop scheduling problem (PFSP) for the makespan minimization criterion is the NEH algorithm. Many research papers have been devoted to the NEH algorithm and its improvements. One of the most interesting improvements is the N-list technique, which can be implemented to other algorithms based on the NEH algorithm. This paper is devoted to analyzing the effect of the reversibility property on the results obtained by the selected algorithms. The analyses were performed on three example algorithms for which the N-list technique was implemented and which used the reversibility property. The analyses were performed using the two most popular benchmarks for the PFSP problem: the Taillard’s benchmark and the VRF benchmark. The results clearly indicate that the use of the reversibility property can significantly improve the results obtained by the algorithm.
Keywords: PFSP, N-list technique, N-NEH+ algorithm, scheduling© This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.