A hybrid GA-PSO algorithm for seru scheduling problem with dynamic resource allocation

As a new type flexible production mode, seru production is widely used in Japanese enterprises to deal with the manufacturing market with volatile and diversified demand. In practical seru production, product processing time may be related to resource allocation, i.e., more resource allocation, less processing time. Thus, this paper attempts to solve seru scheduling problems with dynamic resource allocation, along with which the learning effect of workers is also considered. A combinatorial optimisation model is proposed to minimise the makespan, and a hybrid GA-PSO algorithm with nonlinear inertia weight is specifically designed to solve the proposed model. Finally, a numerical example is presented to verify the effectiveness of hybrid algorithm. The computational results indicate that hybrid GA-PSO algorithm is efficient, and dynamic resource allocation should be considered in seru scheduling problems. [Submitted 1 February 2021; Accepted 30 April 2021]