A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents
HFSP with two agents and its minimality mode are considered and a novel SFLA is proposed. Tournament selection is applied to divide population. Not all solutions of population are allocated into memeplexes. The best solution of each memeplex acts as the object of the search process. The search process consists of the global searches and multiple neighborhood search.
shuffled frog-leaping algorithm hybrid flow shop scheduling two agents minimality model