An exact solution method for solving seru scheduling problems with past-sequence-dependent setup time and learning effect

This paper concentrates on three scheduling problems with past-sequence-dependent setup time and DeJong's learning effect in seru production system (SPS), including minimizing the total waiting time, the total absolute differences in waiting time, and the total load. The setup time, which is dependent on the seru and jobs that have been processed, is considered. Also, the actual processing time with DeJong's learning effect is concerned. We propose a general exact solution method to show these three problems can be transformed into assignment problems and can be solved in polynomial time. Finally, the computational experiments are made to validate that the proposed method is promising in solving seru scheduling problems effectively.

Automated summary

This paper focuses on three scheduling problems in seru production system, involving minimizing total waiting time, total absolute differences in waiting time, and total load. A general exact solution method is proposed to transform these problems into assignment problems and solve them in polynomial time. Computational experiments demonstrate the effectiveness of the proposed method in solving seru scheduling problems.