A Heuristic Line Balancing Algorithm Accounting for Component Mounting Order

摘要

A printed circuit board production line is composed of several component-mounting machines arranged in series that mount components onto each board. Since the performance of the line is determined by the most time consuming machine, the line balancing problem occurs that makes the mounting time by machines as equal as possible. Conventional line balancing procedures use time estimates based on the total number of components to be mounted under each machine. The actual mounting time, however, is often quite different from such estimates, and a substantial discrepancy arises between the actual production time and the estimated one of the line. In the present paper, a new estimation method of mounting time is proposed based on the calculation of the length of mounting paths, and also a heuristic algorithm of the line balancing problem is proposed. The proposed algorithm is shown by computer experiments to provide better results than conventional procedures.