502
Views
22
CrossRef citations to date
0
Altmetric
Articles

Hybrid spider monkey optimisation algorithm for multi-level planning and scheduling problems of assembly lines

, , , &
Pages 6252-6267 | Received 16 Feb 2019, Accepted 26 Sep 2019, Published online: 22 Oct 2019
 

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.

Additional information

Funding

This work has been supported by The National Natural Science Foundation of China [grant numbers 51905196, 51705379 and 71620107002]. The China Postdoctoral Science Foundation [grant number 2019M652665].

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 973.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.