Deterministic model for customized pilot manufacture production with various backplane sizes

Abstract More and more backplane manufacturing industries need a customized pilot production scheme that can produce various sizes of backplanes to support the innovation service of the user-oriented design. The deterministic model of the customized pilot production scheme, which utilizes binary variables and branch-and-bound scheme, can obtain the global optimization; however, this model is hard to solve due to the numerous binary variables and the unbalanced branch-and-bound tree. This study adopted a novel incremental encoding formulation to conquer the unbalanced branch-and-bound issue and a range reduction technique to reduce the required number of binary variables in the proposed model. The proposed model has a faster computation speed compared with the original deterministic model. Numerical experiments further confirmed that the proposed model could obtain a global optimization within a reasonable time for all converged instances of the backplane manufacturing industry and benchmark datasets.