A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Minimizing the assembly cycle time on a revolver gantry machine
Tekijät: Pyottiala S, Knuutila T, Johnsson M, Nevalainen OS
Kustantaja: PERGAMON-ELSEVIER SCIENCE LTD
Julkaisuvuosi: 2013
Journal: Computers and Operations Research
Tietokannassa oleva lehden nimi: COMPUTERS & OPERATIONS RESEARCH
Lehden akronyymi: COMPUT OPER RES
Numero sarjassa: 11
Vuosikerta: 40
Numero: 11
Aloitussivu: 2611
Lopetussivu: 2624
Sivujen määrä: 14
ISSN: 0305-0548
DOI: https://doi.org/10.1016/j.cor.2013.04.014
Tiivistelmä
Unlike to some previous literature on these problems, we suppose that each component can be picked up by a nozzle of a certain type, only. For the feeder assignment problem a new heuristic is given and tested against four existing algorithms. The proposed heuristic considers the types of the r nearest neighbors of each component on the PCB and assigns component feeders close to each other according to the closeness of the component types on the PCB. The experimental tests are performed using two data sets based on realistic PCBs. The new heuristic outperformed the previous methods with 3.4% faster placement times. For determining the pick-up and placement sequences four rule-based algorithms are introduced and their performances evaluated. The best two of these construct the sequences greedily around the placement position of a starting component, which is selected in turns as the component nearest to each corner of the PCB. (c) 2013 Elsevier Ltd. All rights reserved.
Unlike to some previous literature on these problems, we suppose that each component can be picked up by a nozzle of a certain type, only. For the feeder assignment problem a new heuristic is given and tested against four existing algorithms. The proposed heuristic considers the types of the r nearest neighbors of each component on the PCB and assigns component feeders close to each other according to the closeness of the component types on the PCB. The experimental tests are performed using two data sets based on realistic PCBs. The new heuristic outperformed the previous methods with 3.4% faster placement times. For determining the pick-up and placement sequences four rule-based algorithms are introduced and their performances evaluated. The best two of these construct the sequences greedily around the placement position of a starting component, which is selected in turns as the component nearest to each corner of the PCB. (c) 2013 Elsevier Ltd. All rights reserved.
Turun yliopiston Tutkimustietojärjestelmän portaali