Integer programming approach to the printed circuit board grouping problem

DOI10.1080/00207540412331299639zbMath1068.90580OpenAlexW2011284459MaRDI QIDQ5460557

No author found.

Publication date: 18 July 2005

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

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

zbMATH Keywords

column generationzero-one programmingprinted circuit board grouping

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (3)

Measuring production and marketing efficiency using grey relation analysis and data envelopment analysis ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ Development of group setup strategies for makespan minimisation in PCB assembly

Cites Work

• Lifting cover inequalities for the precedence-constrained knapsack problem
• Polyhedral results for the precedence-constrained knapsack problem
• Cell formation in PCB assembly based on production quantitative data
• Set-up saving schemes for printed circuit boards assembly
• Min-cut clustering
• Solving binary cutting stock problems by column generation and branch- and-bound
• A Linear Programming Approach to the Cutting-Stock Problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An integer programming application to solve sequencer mix problems in printed circuit board production
• Grouping PCB_sfor set-up reduction: a maximum spanning tree approach
• Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures

This page was built for publication: Integer programming approach to the printed circuit board grouping problem