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