Improved Mixed-Integer Linear Programming Model for Short-Term Scheduling of the Pressing Process in Multi-Layer Printed Circuit Board Manufacturing

Abstract

The pressing process is a part of the fabrication process of multi-layer printed circuit board (PCB) manufacturing. This paper presents the application of a new mixed-integer linear programming model to the short-term scheduling of the pressing process. The objective was to minimize the makespan. The proposed model is an improvement from our previous model in the literature. The size complexity of the proposed model is better than that of the previous model, whereby the number of variables, constraints, and the dimensionality of variables in the previous model are reduced. To compare their performance, problems from literature and additional generated test problems were solved. The proposed model was shown to outperform the previous model in terms of computational complexity. It can verify a new optimal solution for some problems. For the problems that could not be solved optimally, the proposed model could find the incumbent solution using much less computational time than the previous model, and the makespan of the incumbent solution from the proposed model was better than or equal to that of the previous model. The proposed model can be a good option to provide an optimal schedule for the pressing process in any PCB industry.

Keywords

• pressing process
• printed circuit board
• scheduling
• mixed-integer linear programming