A new hybrid metaheuristics algorithm for minimizing energy consumption in the flow shop scheduling problem

Abstract

In this study, we discuss the problem of permutation flowshop scheduling problem (PFSP) to reduce total energy consumption (TEC). We offer a new hybrid meta-heuristic algorithm for solving the problem. The paper aims to combine the cross entropy and genetic algorithm (CEGA) with the simulated annealing (SA) algorithm. The CEGA is applied to find the best initial solution inside the SA algorithm and the proposed algorithm is compared to previous tests of the famous NSGA-II and GA-SA algorithm. During study of the numerical test, the proposed algorithm genuinely useful is compared certain efficient algorithms of the from previous research.