Development of group setup strategies for makespan minimisation in PCB assembly

DOI10.1080/00207540600690735zbMath1128.90482OpenAlexW2048189160MaRDI QIDQ5444466

Martin Grunow, C. Yapan, Hans-Otto Günther, Ihsan Onur Yilmaz

Publication date: 25 February 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: http://orbit.dtu.dk/en/publications/development-of-group-setup-strategies-for-makespan-minimization-in-pcb-assembly(bb5a9482-d386-4c94-bed0-1b156f767982).html

zbMATH Keywords

clustering algorithmsPCB assemblygroup setup

Mathematics Subject Classification ID

Production models (90B30)

Related Items (2)

A GA-based solution approach for balancing printed circuit board assembly lines ⋮ GA-based adaptive setup planning toward process planning and scheduling integration

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Workload planning in small lot printed circuit board assembly
• Grouping PCB assembly jobs with feeders of several types
• Grouping PCB_sfor set-up reduction: a maximum spanning tree approach
• Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems
• Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures
• Three perspectives for solving the job grouping problem
• Component allocation for printed circuit board assembly using modular placement machines
• Integer programming approach to the printed circuit board grouping problem

This page was built for publication: Development of group setup strategies for makespan minimisation in PCB assembly