Abstract: Hybrid flow shops are widespread in many industrial manufacturing areas. The scheduling problem in hybrid flow shops with multiple constraints has been widely studied in recent years, but there is little study of the scheduling in hybrid flow shops that considers both resource constraints and single batch coupling. To this end, an improved discrete shuffled frog-leaping algorithm is proposed to solve the problem with the objective of minimizing the makespan and machine energy consumption. First, the encoding and decoding methods and an improved NEH initialization method are designed for the problem of single batch coupling and resource. Then, an improved memeplex search strategy is designed by introducing an external solution set. Finally, simulation experiments are conducted through the generated extended examples and the actual calculation examples of enterprises. Experimental results demonstrate the feasibility and effectiveness of the proposed algorithm in solving such problems compared with the existing algorithms.

Key words: resource-constrained, single batch coupling, shuffled frog-leaping algorithm, makespan, energy consumption of machines