Integer programming approach to the printed circuit board grouping problem

Cited 7 time in webofscience Cited 10 time in scopus
  • Hit : 657
  • Download : 16
A printed circuit board (PCB) grouping problem arising from the electronics industry is considered. Given a surface-mounting device with a number of component feeders and several types of PCBs to be produced, the problem is how to group the PCBs so that the total set-up time for component feeders is minimized. The problem is formulated as an integer-programming problem and a column generation approach is proposed to solve it. In this approach, the original problem is decomposed into a master problem and a column-generation subproblem. Starting with a few columns in the master problem, new columns are generated successively by solving the subproblem optimally. To solve the subproblem, a branch-and-cut approach is used. To solve the master problem, a branch-and-bound algorithm is used with the generated columns. However, a branching strategy is also proposed that maintains consistency in the column-generation procedure after branching. Computational experiments show that the solution approach gives high-quality Solutions in reasonable computing time.
Publisher
TAYLOR & FRANCIS LTD
Issue Date
2005-04
Language
English
Article Type
Article
Keywords

CONSTRAINED KNAPSACK-PROBLEM; SET-UP; GROUP TECHNOLOGY; REDUCTION

Citation

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.43, pp.1667 - 1684

ISSN
0020-7543
DOI
10.1080/00207540412331299639
URI
http://hdl.handle.net/10203/7582
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0