DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, S | ko |
dc.contributor.author | Kim, D | ko |
dc.contributor.author | Park, Sungsoo | ko |
dc.date.accessioned | 2008-10-08T13:35:39Z | - |
dc.date.available | 2008-10-08T13:35:39Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2005-04 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.43, pp.1667 - 1684 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | http://hdl.handle.net/10203/7582 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.subject | CONSTRAINED KNAPSACK-PROBLEM | - |
dc.subject | SET-UP | - |
dc.subject | GROUP TECHNOLOGY | - |
dc.subject | REDUCTION | - |
dc.title | Integer programming approach to the printed circuit board grouping problem | - |
dc.type | Article | - |
dc.identifier.wosid | 000228186600009 | - |
dc.identifier.scopusid | 2-s2.0-27744511059 | - |
dc.type.rims | ART | - |
dc.citation.volume | 43 | - |
dc.citation.beginningpage | 1667 | - |
dc.citation.endingpage | 1684 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.identifier.doi | 10.1080/00207540412331299639 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Park, Sungsoo | - |
dc.contributor.nonIdAuthor | Yu, S | - |
dc.contributor.nonIdAuthor | Kim, D | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | printed circuit board grouping | - |
dc.subject.keywordAuthor | zero-one programming | - |
dc.subject.keywordAuthor | column generation | - |
dc.subject.keywordPlus | CONSTRAINED KNAPSACK-PROBLEM | - |
dc.subject.keywordPlus | SET-UP | - |
dc.subject.keywordPlus | GROUP TECHNOLOGY | - |
dc.subject.keywordPlus | REDUCTION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.