Abstract

This paper aims to investigate the seru scheduling problem while considering the dual effects of worker cooperation and learning behavior to minimize the makespan and order processing time. Given the complexity of this research problem, an improved shuffled frog leaping algorithm based on a genetic algorithm is proposed. We design a double-layer encoding based on the problem, introduce a single point and uniform crossover operator, and select the crossover method in probability form to complete the evolution of the meme group. To avoid damaging grouping information, the individual encoding structure is transformed into unit form. Finally, numerical experiments were conducted using numerical examples of large and small sizes for verification. The experimental results demonstrate the feasibility of the proposed model and algorithm, as well as the necessity of considering worker dual behavior in the seru scheduling problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call