Jiangping HuangQuanke PanM. Fatih TasgetirenYingying HuangTasgetiren, M FatihHuang, Ying-YingPan, Quan-KeHuang, Jiang-PingJ. Fu , J. Sun2025-10-0620209789881563941, 9789887581581, 9789887581536, 9789881563804, 9789881563910, 9789881563842, 9789881563972, 9789881563811, 9789881563835, 9789887581543978988156390321612927, 193417682161-29271934-176810.23919/CCC50068.2020.91887272-s2.0-85091401885https://www.scopus.com/inward/record.uri?eid=2-s2.0-85091401885&doi=10.23919%2FCCC50068.2020.9188727&partnerID=40&md5=66af2feb371fc2558624f137711c87a7https://gcris.yasar.edu.tr/handle/123456789/9188https://doi.org/10.23919/CCC50068.2020.9188727In this paper we present a new heuristic to divide a batch of printed circuit boards (PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic we propose several concepts about similarity to make the number of groups as few as possible. To better show the relationship between the PCB types and the component types of a group we introduce a new solution representation. In addition considering the characteristics of the PCBs grouping problem (PGP) a method for pairing PCBs is presented. With the PCB pairs an iterative scheme is applied to start a new group. We try the rest PCBs one by one according to the similarity between it and the PCB group. Finally the experiments and comparisons show the good performance of the proposed heuristic. © 2020 Elsevier B.V. All rights reserved.Englishinfo:eu-repo/semantics/closedAccessGrouping, Heuristic, Pcbs, Setup Time, Similarity, Iterative Methods, Unloading, Grouping Problem, Iterative Schemes, Loading And Unloading, Printed Circuit Board (pcbs), Set-up Time, Solution Representation, Printed Circuit BoardsIterative methods, Unloading, Grouping problem, Iterative schemes, Loading and unloading, Printed circuit board (PCBs), Set-up time, Solution representation, Printed circuit boardsPCBsHeuristicGroupingSimilaritySetup TimeConference Object