A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents

作者：

Highlights：

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

摘要

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

论文关键词：Hybrid flow shop scheduling,Shuffled frog-leaping algorithm,Minimality model,Two agents

论文评审过程：Received 1 May 2014, Revised 13 August 2015, Accepted 14 August 2015, Available online 28 August 2015, Version of Record 9 September 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.08.025