English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

This article addresses the printed circuit board (PCB) grouping problem (PGP) in the electronic assembly industry. First, a mathematical model of PGP is presented. Then, four heuristics based on an iterative scheme are proposed. Two of them are constructive heuristics and the other two are composite heuristics. Based on the problem-specific characteristics, a new solution representation that consists of PCB assignment and component assignment is proposed. For the constructive heuristics, one is based on a single PCB and the other is based on a pair of PCBs. The composite heuristics consist of the constructive heuristics and a local search method formed by three new operators. To test the effectiveness of the presented heuristics, 100 problem instances are designed according to the real-world production process. The experiments and comparisons show that the presented heuristics perform much better than those in the literature.

Effective constructive and composite heuristics for grouping printed circuit boards in the electronic assembly industry