The manufacturing of Printed Circuit Boards (PCBs) is an important issue in the elctronic industry. The core of this process is the insertion of electronic parts into predefined places on a board. To this purpose a numerically controlled assembly system, consisting of machines working sequentially, is used. Each machine has a number of bins (feeders) containing parts to be inserted in the boards. A bin cannot contain more than one part type. However, a part type can be allocated to various bins (possibly of different machines). At each station an arm grasps a part from a bin, moves to the part location, inserts it and then returns to the bin. When the last part is inserted, another board is processed. Once the system has been designed, three operational decisions are to be taken: the allocation of part types to machines, the assignment of part types to feeders, the pick and place sequencing system, i.e. The minimisation of the processing times of the slowest machine. In this paper the whole operational ptoblem is modelled as a min-max allocation-routing problem and a Taboo Search heuristic is presented. This procedure is evaluated using both real world and randomly generated instances. Computational results show that heuristic allows achieving remarkable cost savings.

A Tabu Search Heuristic for the Optimization of a Multi-Stage Component Placement System

BRUNO, GIUSEPPE;IMPROTA, GENNARO;
2005

Abstract

The manufacturing of Printed Circuit Boards (PCBs) is an important issue in the elctronic industry. The core of this process is the insertion of electronic parts into predefined places on a board. To this purpose a numerically controlled assembly system, consisting of machines working sequentially, is used. Each machine has a number of bins (feeders) containing parts to be inserted in the boards. A bin cannot contain more than one part type. However, a part type can be allocated to various bins (possibly of different machines). At each station an arm grasps a part from a bin, moves to the part location, inserts it and then returns to the bin. When the last part is inserted, another board is processed. Once the system has been designed, three operational decisions are to be taken: the allocation of part types to machines, the assignment of part types to feeders, the pick and place sequencing system, i.e. The minimisation of the processing times of the slowest machine. In this paper the whole operational ptoblem is modelled as a min-max allocation-routing problem and a Taboo Search heuristic is presented. This procedure is evaluated using both real world and randomly generated instances. Computational results show that heuristic allows achieving remarkable cost savings.
File in questo prodotto:
File Dimensione Formato  
component placement.pdf

accesso aperto

Tipologia: Documento in Post-print
Licenza: Dominio pubblico
Dimensione 8.33 MB
Formato Adobe PDF
8.33 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11588/106745
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact