Grouping PCBsfor set-up reduction: a maximum spanning tree approach

DOI10.1080/00207549608904923zbMath0926.90024OpenAlexW2003094985MaRDI QIDQ4230086

G. Bhaskar, T. T. Narendran

Publication date: 29 November 1999

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

Full work available at URL: https://doi.org/10.1080/00207549608904923

zbMATH Keywords

groupingprinted circuit boardsautomatic assemblycosine similarity coefficient

Mathematics Subject Classification ID

Production models (90B30)

Related Items (8)

Optimization of the assignment of circuit cards to assembly lines in electronics assembly ⋮ Flexibility analysis of a surface mount technology electronic assembly plant: An integrated model using simulation ⋮ Tool-feeder partitions for module assignment in PCB assembly ⋮ A quantitative approach for scheduling activities to reduce set-up in multiple machine lines ⋮ Development of group setup strategies for makespan minimisation in PCB assembly ⋮ Integer programming approach to the printed circuit board grouping problem ⋮ Three perspectives for solving the job grouping problem ⋮ A reduction technique for weighted grouping problems

Cites Work

• Cell formation in PCB assembly based on production quantitative data
• Set-up saving schemes for printed circuit boards assembly
• An integer programming application to solve sequencer mix problems in printed circuit board production
• A clustering algorithm for machine cell formation in group technology using minimum spanning trees

This page was built for publication: Grouping PCB_sfor set-up reduction: a maximum spanning tree approach