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...

In this paper, a hybrid genetic algorithm is proposed to solve the no-wait flowshop scheduling problem with the makespan objective. The proposed algorithm hybridizes the genetic algorithm and a novel local search scheme. The OA-crossover operator is designed to enhance the capability of...