Abstract
The production planning and scheduling problems of printed circuit board (PCB) assembly line robustly influence the production efficiency of PCB industries. The current study focuses on the optimisation of the multi-level planning and scheduling problem by minimising the cycle time of the PCB assembly lines. Two levels of planning problems i.e. component allocation problem (CAP) and component placement sequence problem (CPSP) are solved simultaneously using mixed integer linear programming model. In CAP, a model is formulated with the objective of balancing the workload among the surface mounted machines (SMM), while in CPSP, a model is formulated to find optimum sequencing for allocated components at each SMM. A novel hybrid spider monkey optimisation (HSMO) algorithm is proposed with the addition of new sorting food sources and genetic operators in the standard spider monkey optimisation (SMO) algorithm. The performance of the proposed HSMO algorithm is validated by comparing the solutions with well-known algorithms, i.e. genetic algorithm (GA), particle swarm optimisation (PSO), simulated annealing (SA) and artificial bee colony (ABC) algorithms. The proposed HSMO algorithm is tested on different problem set instances scaled based on the realistic production of PCB industries. The detailed analysis of results indicates that the proposed HSMO algorithm outperforms the compared algorithms in efficiency and effectiveness.
Disclosure statement
No potential conflict of interest was reported by the authors.