메뉴 건너뛰기




Volumn 34, Issue 1, 2007, Pages 163-179

The quadratic assignment problem in the context of the printed circuit board assembly process

Author keywords

Combinatorial optimization; Metaheuristics; Printed circuit board assembly; Quadratic assignment problem

Indexed keywords

COMPUTER ARCHITECTURE; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PRINTED CIRCUIT MANUFACTURE; PROBLEM SOLVING; SIMULATED ANNEALING;

EID: 33746372113     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.05.004     Document Type: Article
Times cited : (57)

References (23)
  • 2
    • 33746338017 scopus 로고    scopus 로고
    • Duman E. Optimization issues in automated assembly of printed circuit boards. PhD dissertation, Bogazici University, Turkey, 1998.
  • 3
    • 0034789073 scopus 로고    scopus 로고
    • Planning for printed circuit board assembly: the state-of-the-art review
    • Ji P., and Wan Y.F. Planning for printed circuit board assembly: the state-of-the-art review. International Journal of Computer Applications in Technology 14 4-6 (2001) 136-144
    • (2001) International Journal of Computer Applications in Technology , vol.14 , Issue.4-6 , pp. 136-144
    • Ji, P.1    Wan, Y.F.2
  • 5
    • 0027595708 scopus 로고
    • Optimal bin location and sequencing in printed circuit board assembly
    • Foulds L.R., and Hamacher H.W. Optimal bin location and sequencing in printed circuit board assembly. European Journal of Operational Research 66 (1993) 279-290
    • (1993) European Journal of Operational Research , vol.66 , pp. 279-290
    • Foulds, L.R.1    Hamacher, H.W.2
  • 6
    • 0023981635 scopus 로고
    • Sequencing of insertions in printed circuit board assembly
    • Ball M.O., and Magazine M.J. Sequencing of insertions in printed circuit board assembly. Operations Research 36 (1988) 192-201
    • (1988) Operations Research , vol.36 , pp. 192-201
    • Ball, M.O.1    Magazine, M.J.2
  • 7
    • 1142280337 scopus 로고    scopus 로고
    • Precedence constrained TSP arising in printed circuit board assembly
    • Duman E., and Or I. Precedence constrained TSP arising in printed circuit board assembly. International Journal of Production Research 42 (2004) 67-78
    • (2004) International Journal of Production Research , vol.42 , pp. 67-78
    • Duman, E.1    Or, I.2
  • 8
    • 0027656565 scopus 로고
    • Precedence constrained TSP applied to circuit board assembly and no wait flow-shop
    • Chan D. Precedence constrained TSP applied to circuit board assembly and no wait flow-shop. International Journal of Production Research 31 (1993) 2171-2177
    • (1993) International Journal of Production Research , vol.31 , pp. 2171-2177
    • Chan, D.1
  • 9
    • 33746345386 scopus 로고    scopus 로고
    • Duman E, Or I. Constrained multiple TSP arising in printed circuit board assembly. Proceedings of the engineering technology research conference, South Africa: Vanderbijlpark; 2002. p. 9-13.
  • 10
    • 0021487364 scopus 로고
    • On optimizing bin packing and insertion plans for assembly robots
    • Drezner Z., and Nof S.Y. On optimizing bin packing and insertion plans for assembly robots. IIE Transactions 16/3 (1984) 262-270
    • (1984) IIE Transactions , vol.16-3 , pp. 262-270
    • Drezner, Z.1    Nof, S.Y.2
  • 11
    • 0001937491 scopus 로고
    • Feeder assignment models for concurrent placement machines
    • Grotzinger S. Feeder assignment models for concurrent placement machines. IIE Transactions 24 4 (1992) 31-47
    • (1992) IIE Transactions , vol.24 , Issue.4 , pp. 31-47
    • Grotzinger, S.1
  • 12
    • 33746372226 scopus 로고    scopus 로고
    • Burkard RE. Locations with spatial interactions: the quadratic assignment problem. In: Mirchandani PB, Francis RL, editors. Discrete location theory. Wiley Intersection series in discrete mathematics and optimization, 1990. p. 387-437.
  • 14
    • 84989762317 scopus 로고
    • A parametric based heuristic program for the quadratic assignment problem
    • White D.J. A parametric based heuristic program for the quadratic assignment problem. Naval Research Logistics 40 (1993) 553-568
    • (1993) Naval Research Logistics , vol.40 , pp. 553-568
    • White, D.J.1
  • 15
    • 0000956123 scopus 로고    scopus 로고
    • The quadratic assignment problem
    • Du D.Z., and Pardalos P.M. (Eds), Kluwer Academic Publishers, Dordrecht
    • Burkard R.E., Cela E., Pardalos P.M., and Pitsoulis L.S. The quadratic assignment problem. In: Du D.Z., and Pardalos P.M. (Eds). Handbook of combinatorial optimization vol. 3 (1999), Kluwer Academic Publishers, Dordrecht 241-337
    • (1999) Handbook of combinatorial optimization , vol.3 , pp. 241-337
    • Burkard, R.E.1    Cela, E.2    Pardalos, P.M.3    Pitsoulis, L.S.4
  • 16
    • 33746361001 scopus 로고    scopus 로고
    • Pardalos PM, Pitsoulis LS, editors. Nonlinear assignment problems: algorithms and applications. Kluwer Academic Publishers, 2000.
  • 17
    • 0030092646 scopus 로고    scopus 로고
    • Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
    • Resende M.G.C., Pardalos P.M., and Li Y. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 22 (1996) 104-118
    • (1996) ACM Transactions on Mathematical Software , vol.22 , pp. 104-118
    • Resende, M.G.C.1    Pardalos, P.M.2    Li, Y.3
  • 18
    • 0031152332 scopus 로고    scopus 로고
    • Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
    • Pardalos P.M., Pitsoulis L.S., and Resende M.G.C. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 23 (1997) 196-208
    • (1997) ACM Transactions on Mathematical Software , vol.23 , pp. 196-208
    • Pardalos, P.M.1    Pitsoulis, L.S.2    Resende, M.G.C.3
  • 20
    • 0026189990 scopus 로고
    • Robust taboo search for the quadratic assignment problem
    • Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
    • (1991) Parallel Computing , vol.17 , pp. 443-455
    • Taillard, E.1
  • 21
    • 33746349955 scopus 로고
    • An improved annealing scheme for the quadratic assignment problem
    • Connaly D.T. An improved annealing scheme for the quadratic assignment problem. European Journal of Operational Research 46 (1990) 93-100
    • (1990) European Journal of Operational Research , vol.46 , pp. 93-100
    • Connaly, D.T.1
  • 22
    • 0028514383 scopus 로고
    • A guided evolutionary simulated annealing approach to the quadratic assignment problem
    • Yip P.P.C., and Pao Y.H. A guided evolutionary simulated annealing approach to the quadratic assignment problem. IEEE Transactions on Systems, Man and Cybernetics 24 (1994) 1383-1387
    • (1994) IEEE Transactions on Systems, Man and Cybernetics , vol.24 , pp. 1383-1387
    • Yip, P.P.C.1    Pao, Y.H.2
  • 23
    • 33746361899 scopus 로고    scopus 로고
    • A quadratic assignment problem in the automated assembly of printed circuit boards
    • Or I., and Atik K. A quadratic assignment problem in the automated assembly of printed circuit boards. Journal of the Operations Research Society of Turkey 11 (2000) 67-88
    • (2000) Journal of the Operations Research Society of Turkey , vol.11 , pp. 67-88
    • Or, I.1    Atik, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.