Set-up saving schemes for printed circuit boards assembly

Abstract Focusing on a basic printed circuit board (PCB) assembly line configuration characterized by very long set-up times, we examine two scheduling methods that can significantly reduce the set-up. Both methods — the Grouped Set-Up (GSU) method that has been recently introduced in the literature and the Sequence Dependent Scheduling (SDS) method, which has not been studied in this context — are based on component commonality among PCB types. Using the typical traditional scheduling method as a benchmark, the GSU and the SDS methods are compared in terms of three performance measures: line throughput, average work-in-process (WIP) inventory level, and implementation complexity. Guidelines for selecting the most appropriate method for a given production environment are proposed. The analysis is illustrated using real data from a typical production line.

[1]  Jim Browne,et al.  A LISP-based heuristic scheduler for automatic insertion in electronics assembly , 1986 .

[2]  Oded Maimon,et al.  Group set-up for printed circuit board assembly , 1989 .

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  J. A. Esrom Semi-Custom IC Design and VLSI edited by P. J. Hicks Peter Peregrinus, London, 1983, xii + 218 pp., index (£12.50 in the UK, £16.00 elsewhere) , 1984, Robotica.

[5]  Yahya Fathi,et al.  A mathematical model for loading the sequencers in a printed circuit pack manufacturing environment , 1989 .

[6]  C. S. Tang A job scheduling model for a flexible manufacturing machine , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[7]  J. G. Wager,et al.  Set-up times in cyclic and acyclic Group Technology Scheduling systems , 1983 .

[8]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[9]  Nicos Christofides Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Tien-Chien Chang,et al.  A rule based system for printed wiring assembly process planning , 1987 .

[12]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[13]  Vangelis F. Magirou The Efficient Drilling of Printed Circuit Boards , 1986 .

[14]  Leon F. McGinnis,et al.  Soft configuration in automated insertion , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[15]  F. R. Furth A message from rear admiral , 1954 .

[16]  Andrew Kusiak,et al.  Grouping problem in scheduling flexible manufacturing systems , 1985, Robotica.