A shuffled frog-leaping algorithm with three memeplexes for hybrid flowshop scheduling problem with two batch processing machines stages

Hybrid flowshop scheduling problem (HFSP) with batch processing machines (BPM) has attracted some attention by using various meta-heuristics. In this study, HFSP with two BPM stages is solved and a shuffled frog-leaping algorithm with three memeplexes (TMSFLA) is presented to minimize makespan and totardiness. In TMSFLA, the number of memeplexes is not used as parameter and fixed to be 3. A new way is given to divide population into three memeplexes. Lexicographical method is adopted in memeplex 2 for makespan and memeplex 3 for total tardiness. The differentiated search strategies are used in three memeplexes and reinforcement search is added. Extensive experiments are conducted. The effectiveness of new strategies and the search advantages are tested for TMSFLA in solving HFSP with two BPM stages.