Exact method based on solution space cut for bi-objective Seru Production

$ Seru $ Production is an innovative production mode frequently utilized in electronic assembly enterprises. Up to now, there is no exact algorithm for the bi-objective $ Seru $ Production. We develop an innovative exact method based on decomposition and cutting solution space to obtain the exact Pareto-optimal solutions for the first time. $ Seru $ Production is decomposed into two decision processes, i.e., $ seru $ formation and $ seru $ scheduling. We define dominated $ seru $ formations and cut 97% dominated $ seru $ formations based on the ideal point and Non-Dominated Incumbent Solutions (NDIS). Thus, the Pareto-optimal solutions is obtained by executing Non-dominant Sort ($ NS $) for all the non-dominated $ seru $ formations. The $ \varepsilon $-constraint method is applied in $ seru $ scheduling to obtain the Pareto-optimal schedules for a given $ seru $ formation. In addition, the current best algorithms for solving multi-objective $ Seru $ Production are used to ensure the initial NDIS high-quality. Finally, parallel programming is performed according to the characteristics of $ Seru $ Production. Test data verify that proposed exact method can find the Pareto-optimal solution set for all small-scale and most medium-scale instances of bi-objective $ Seru $ Production.Keywords: $ Seru $ Production, bi-objective programming, exact method, solution space cut, $ seru $ formation dominance, intelligent algorithm, parallel programming.