A two-stage heuristic algorithm for dynamic seru scheduling problems with resource constraints

Originating from the Japanese electronics assembly industry, the seru production mode offers high efficiency, flexibility, and rapid responsiveness in manufacturing. This paper addresses the unspecified dynamic seru scheduling problem with resource constraints (UDSS-R), where resource usage must not exceed the available total at any given time. The UDSS-R problem is formulated as a mixed-integer linear programming (MILP) model aimed at minimizing the makespan. A two-stage heuristic algorithm is proposed subsequently: the first stage addresses the regular seru scheduling problem (without resource constraints) by assigning jobs to serus, and the second stage uses a dynamic programming algorithm based on the 0-1 knapsack problem to finalize the schedule. Computational experiments demonstrate the practicality and effectiveness of the proposed MILP model and the two-stage heuristic algorithm in solving the UDSS-R problem