Multi-Level Planning and Scheduling for Parallel PCB Assembly Lines Using Hybrid Spider Monkey Optimization Approach
Open Access
- 31 January 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 18685-18700
Abstract
Printed circuit board (PCB) assembly lines are significant to produce a variety of electronic products. PCB manufacturing industries tend to move towards automated and complex manufacturing system due to an increase in the customer demand for more sophisticated products. PCB assembly process involves highly interrelated levels of planning and scheduling problems. Therefore, the current research investigates multi-level planning and scheduling of PCB assembly lines, which include line assignment to the PCB models, component allocations to machines, and component placement sequencing by machines on PCB boards. A mixed integer-programming model is developed to integrate the planning and scheduling problem of parallel PCB assembly lines to maximize the net profit. A hybrid spider monkey optimization (HSMO) algorithm is proposed to solve the multi-level planning and scheduling problem. The performance of the proposed HSMO algorithm is compared to artificial bee colonial (ABC), genetic algorithm (GA), particle swarm optimization (PSO), and simulated annealing (SA) algorithms. Moreover, the proposed HSMO algorithm is validated against ABC, GA, PSO, and SA algorithms with the case problem taken from well-reputed PCB manufacturing industry in China. The computation experiments indicate that the proposed HSMO algorithm can achieve good near-optimal solutions when compared with the other-mentioned four algorithms based on performance and efficiency for benchmark problems and real case problem.Keywords
Funding Information
- National Natural Science Foundation of China (51705379, 51035001, 51121002, 71131004)
This publication has 35 references indexed in Scilit:
- An integrated scheduling problem of PCB components on sequential pick-and-place machines: Mathematical models and heuristic solutionsExpert Systems with Applications, 2009
- Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimizationEngineering Optimization, 2006
- Operations planning for collect-and-place machines in PCB assemblyComputers & Industrial Engineering, 2004
- Optimal algorithm for minimizing production cycle time of a printed circuit board assembly lineInternational Journal of Production Research, 2004
- Integrated methodology for board assignment and component allocation in printed circuit board assemblyInternational Journal of Production Research, 2003
- Planning for printed circuit board assembly: the state-of-the-art reviewInternational Journal of Computer Applications in Technology, 2001
- QUALITY-CENTERED PRODUCTIVITY IMPROVEMENT IN SURFACE-MOUNTED PCB ASSEMBLYQuality Engineering, 2000
- Component allocation and job sequencing for two series-connected SMD placement machinesInternational Journal of Production Research, 2000
- Optimization of high-speed multistation SMT placement machines using evolutionary algorithmsIEEE Transactions on Electronics Packaging Manufacturing, 1999
- Annealing method for PCB assembly scheduling on two sequential machinesInternational Journal of Computer Integrated Manufacturing, 1992