You are here: TUCS > PUBLICATIONS > Publication Search > Job Grouping in Surface Mounte...
Job Grouping in Surface Mounted Component Printing
Jouni Smed, Mika Johnsson, Mikko Puranen, Timo Leipälä, Olli Nevalainen, Job Grouping in Surface Mounted Component Printing. TUCS Technical Reports 196, Turku Centre for Computer Science, 1998.
Abstract:
The arrangement of operations in a production line for mounting the surface components on a printed circuit board is discussed. The production program includes a wide range of different products, which causes frequent set-up operations. The overall efficiency of the production line depends heavily on how the printing operations are organized. Set-ups cause delays which can be cut down by selecting carefully the feeders for the components and by solving a suitable sequence for the products. We describe an integrated production management system for job grouping. The system utilizes approximative algorithms for minimizing the number of component switching instants. A discussion of the exact minimization by using mathematical 0/1 integer programming approach is also given. The revision of the production management system has had a major impact on the productivity, and an increase of ca. 58 percent in the number of component insertions per hour is observed. This report is a revision of TUCS Technical Report No 139, which considered batch selection problem, whereas the present work is focused on job grouping problem in the same production environment. Furthermore, improved algorithms, a new mathematical model and a survey of relevant literature are presented here.
<p>Contact authors for the complete report.
BibTeX entry:
@TECHREPORT{tSmJoPuLeNe98a,
title = {Job Grouping in Surface Mounted Component Printing},
author = {Smed, Jouni and Johnsson, Mika and Puranen, Mikko and Leipälä, Timo and Nevalainen, Olli},
number = {196},
series = {TUCS Technical Reports},
publisher = {Turku Centre for Computer Science},
year = {1998},
keywords = {printed circuit board, group technology, approximative algorithm},
ISBN = {952-12-0257-2},
}