Combinatorial Optimization Problems in PCB Assembly
暂无分享,去创建一个
We analyze combinatorial optimization problems arising in a component insertion line for printed circuit board mounting. Such a line consists of a number of fully automated placement machines, connected by an automated, carrierless conveyor system. Each machine has a placement device, consisting of an arm equipped with three placement heads. Each head may pick and place certain component types; there is some freedom in the choice of equipment for each head. Components are supplied to each machine by tape feeders (each containing components of only one type) which are placed at certain feeder positions along the machine.
[1] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.