Study of the rheological behaviour of Sn-Ag-Cu solder pastes and their correlation with printing performance

Solder paste plays an important role in the electronic assembly process by providing electrical, mechanical and thermal bonding between the components and the substrate. The rheological characterisation of pastes is an important step in the design and development of new paste formulations. With the ever increasing trend of miniaturisation of electronic products, the study of the rheological properties of solder pastes is becoming an integral part in the R&D of new paste formulations and in the quality monitoring and control during paste manufacture and electronic assembly process. This research work outlines some of the novel techniques which can be successfully used to investigate the rheology of leadfree solder pastes. The report also presents the results of the correlation of rheological properties with solder paste printing performance. Four different solder paste samples (namely paste P1, P2, P3 and P4) with different flux vehicle systems and particle size distributions were investigated in the study. As expected, all the paste samples showed shear thinning behaviour. Although the samples displayed similar flow behaviour at high shear rates, differences were observed at low shear rates. In the stencil printing trials, round deposits showed better results than rectangular deposits in terms of paste heights and aperture filling. Our results demonstrate a good correlation between higher paste viscosity and good printing performance. The results of the oscillatory and thixotropy tests were also successfully correlated to the printing behaviour of solder paste.

Operator non-availability periods

In the scheduling literature, the notion of machine non availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to a new type of scheduling problems, namely problems of finding schedules that respect the operator non availability periods. These problems are analyzed on a single machine with the makespan as criterion. Properties are described and performance ratios are given for list scheduling and other polynomial-time algorithms.