Integer programming approach to the printed circuit board grouping problem

International Journal of Production Research

Volumn 43, Issue 8, 2005, Pages 1667-1684

  Yu, S ^a   Kim, D ^b   Park, S ^b  

^a Catholic University of Pusan   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Column generation; Printed circuit board grouping; Zero one programming

Indexed keywords

INTEGER PROGRAMMING; PROBLEM SOLVING;

COLUMN GENERATION; PRINTED CIRCUIT BOARD GROUPING; SURFACE-MOUNTING DEVICE; ZERO-ONE PROGRAMMING;

PRINTED CIRCUIT BOARDS;

EID: 27744511059     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540412331299639     Document Type: Article

References (22)

1. Bhaskar, G. and Narendran, T.T., Grouping PCBs for set-up reduction: a maximum spanning tree approach. Int. J. Prod. Res., 1996, 34, 621-632.
2. Boyd, E.A., Polyhedral results for the precedence constrained knapsack problem. Disc. Appl. Math., 1993, 41, 185-201.
3. Carmon, T.F., Maimon, O.Z. and Dal-El, E.M., Group set-up for printed circuit board assembly. Int. J. Prod. Res., 1989, 27, 1795-1810.
4. Crama, Y., Kolen, A.W.J., Oerlemans, A.G. and Spieksma, F.C.R., Throughput rate optimization in the automated assembly of printed circuit boards. Ann. Oper. Res., 1990, 26, 455-480.
5. Daskin, M.S., Maimon, O., Shtub, A. and Braha, D., Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedure. Int. J. Prod. Res., 1997, 35, 1617-1638.
6. Gilmore, P.C. and Gomory, R.E., A linear programming approach to the cutting-stock problem. Oper. Res., 1961, 9, 849-859.
7. Hashiba, S. and Chang, T., PCB assembly set-up reduction using group technology. Comput. Ind. Eng., 1991, 21, 453-457.
8. Johnson, E.L., Mehrotra, A. and Nemhauser, G.L., Min-cut clustering. Math. Progr., 1993, 62, 133-151.
9. Kusiak, A., The generalized group technology concept. Int. J. Prod. Res., 1987, 25, 561-569.
10. Luzzato, D. and Perona, M., Cell formation in PCB assembly based on production quantitative data. Eur. J. Oper. Res., 1993, 69, 312-329.
11. Maimon, O.Z., Dal-El, E.M. and Carmon, T.F., Set-up saving schemes for printed circuit board assembly. Eur. J. Oper. Res., 1993, 70, 177-190.
12. Maimon, O. and Shtub, A., Grouping methods for printed circuit board assembly. Int. J. Prod. Res., 1991, 29, 1379-1390.
13. Nemhauser, G.L. and Wolsey, L.A., Integer and Combinatorial Optimization, 1988 (Wiley, New York).
14. Padberg, M. and Rinaldi, G., A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev., 1991, 33, 60-100.
15. Park, K. and Park, S., Lifting cover inequalities for the precedence-knapsack problem. Disc. Appl. Math., 1997, 72, 219-241.
16. Rajkumar, K. and Narendran, T.T., A heuristic for sequencing PCB assembly to minimize set-up times. Prod. Plan. Control., 1998, 9, 465-476.
17. Randhawa, S.U., McDowell, E.D. and Faruqui, S., An integer-programming application to solve sequencer mix problems in printed circuit board production. Int. J. Prod. Res., 1985, 23, 543-552.
18. Ryan, D.M. and Foster, B.A., An integer programming approach to scheduling, in Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269-280, 1981, edited by A. Wren (North-Holland, Amsterdam).
19. Shtub, A. and Maimon, O., Role of similarity measures in PCB grouping procedures. Int. J. Prod. Res., 1992, 30, 973-983.
20. Sokal, R.R. and Sneath, P.H.A., Principles of Numerical Taxonomy, 1963 (San Francisco, Freeman).
21. Vance, P.H., Banhart, E.L., Johnson, E.L. and Nemhauser, G.L., Solving binary cutting stock problem by column generation and branch-and-bound. Computat. Optim. Appl., 1994, 3, 111-130.
22. Yu, S., Sohn, J., Park, S. and Oh, B.J., Efficient operation of a multi-functional surface mounting device. Comput. Ind. Eng., 1997, 33, 797-800.