Sequencing of insertions in printed circuit board assembly
Operations Research
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Production planning problems in printed circuit board assembly
Discrete Applied Mathematics
Component scheduling for chip shooter machines: a hybrid genetic algorithm approach
Computers and Operations Research
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
A generic classification and object-oriented simulation toolkit for SMT assembly equipment
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A model to optimize placement operations on dual-head placement machines
Discrete Optimization
Organizing the operation of radial machine sequencers for multiple PCB types
Computers and Industrial Engineering
Minimizing the assembly cycle time on a revolver gantry machine
Computers and Operations Research
| Hi-index | 0.01 |
With a great variation of products, PCB assembling machines must be reconfigured often, but at the same time the efficiency of the assembly process should be kept high. In this paper we consider PCB assembly machines of the radial type, which are used for manufacturing robust electronics devices. In this machine type the components are brought to the assembly point by the means of a single component tape, and a robotic arm places them onto a bare PCB one at a time. The component tape is constructed on-line by a separate feeder unit (sequencer) composed of a set of slots storing component reels of various types. While the insertion of components to the tape does not normally delay their placements on the PCB, certain (broad) components delay the processing due to the operation principle of the sequencer, thus increasing the manufacturing time. We study the problem of assigning components to the sequencer in such a way that tape construction delay is minimized, give an integer programming formulation of the problem, and present an optimization algorithm to reduce the component insertion time caused by slow components. The results of this optimization algorithm show considerable improvement against a simple feeder assignment, in case of tape instances containing repeating sequences of components.