Clustering methods for printed circuit board insertion problems

Journal of the Operational Research Society

Volumn 51, Issue 10, 2000, Pages 1205-1211

  Ng, M K ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Clustering; Heuristics; Optimisation; Production sequencing; Travelling salesman

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; PRINTED CIRCUIT MANUFACTURE; PRODUCTION CONTROL;

CLUSTERING METHODS; FEEDER BANKS;

TRAVELING SALESMAN PROBLEM;

EID: 0034298575     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601018     Document Type: Article

References (4)

1. Ng M. (1998). Heuristics approach to printed circuit board insertion problem. J Opl Res Soc 49: 1051-1059.
2. McGinnis LF et al (1992). Automated process planning for printed circuit card assembly. IIE Trans 24: 18-30.
3. Lawler E, Lenstra J, Kan A and Shmoys D. (1985). The Traveling Salesman Problem. Wiley: New York.
4. Jain A and Dubes R (1988). Algorithms for Clustering Data. Prentice Hall: Englewood Cliffs, NJ, USA.