Traditionally, the permutation flowshop scheduling problem (PFSP) was with the criterion of minimizing makespan. The permutation flowshop scheduling problem to minimize the total flowtime has attracted more attention from researchers in recent years. In this paper, a hybrid genetic local search...

Recently, the flowshop scheduling problem to minimize total flowtime has attracted more attention from researchers. In this paper, a genetic local search algorithm is proposed to solve this problem. The proposed algorithm hybridizes the genetic algorithm and the tabu search. It employs the...