Integrated component scheduling models for chip shooter machines
William Ho and
Ping Ji
International Journal of Production Economics, 2010, vol. 123, issue 1, 31-41
Abstract:
This paper focuses on minimizing printed circuit board (PCB) assembly time for a chip shooter machine, which has a movable feeder carrier holding components, a movable X-Y table carrying a PCB, and a rotary turret with multiple assembly heads. The assembly time of the machine depends on two inter-related optimization problems: the component sequencing problem and the feeder arrangement problem. Nevertheless, they were often regarded as two individual problems and solved separately. This paper proposes two complete mathematical models for the integrated problem of the machine. The models are verified by two commercial packages. Finally, a hybrid genetic algorithm previously developed by the authors is presented to solve the model. The algorithm not only generates the optimal solutions quickly for small-sized problems, but also outperforms the genetic algorithms developed by other researchers in terms of total assembly time.
Keywords: PCB; assembly; Optimization; Component; sequencing; Feeder; arrangement; Hybrid; genetic; algorithm (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00246-1
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:123:y:2010:i:1:p:31-41
Access Statistics for this article
International Journal of Production Economics is currently edited by Stefan Minner
More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().