A genetic algorithm approach to scheduling PCBs on a single machine

This paper addresses the problem of scheduling N printed circuit boards (PCBs) on a single machine equipped with an automatic component interchange mechanism. Assume that the total number of different components required to process all N PCBs is greater than the capacity of the spool. If the requisite components are not on the spool, then one or more component switches must occur before the PCB can be processed. The problem consists of finding the order to schedule the PCBs on the axial insertion machine and the components to place on the spool before each PCB is processed. The performance criterion is to minimize the total number of component switches. This problem is addressed employing a genetic algorithm to search the space of alternative solutions. To evaluate the performance of the GA, a heuristic solution based on a travelling salesman formulation is described. Extensive experiments were carried out for both approaches based on data extracted from industrial scenes.

[1]  Pius J. Egbelu,et al.  Job scheduling in a group technology environment for a single facility , 1985 .

[2]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[3]  Dirk Van Gucht,et al.  Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..

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

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  John J. Grefenstette,et al.  Genetic algorithms and their applications , 1987 .

[7]  Richard C. Wilson,et al.  Sequence dependent set-up times and job sequencing , 1977 .

[8]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Jean-Yves Potvin,et al.  Genetic Algorithms for the Traveling Salesman Problem , 2005 .

[10]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..

[11]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[12]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[13]  Christopher S. Tang,et al.  Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants , 1988, Oper. Res..

[14]  D. J. Smith,et al.  A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

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

[16]  Avraham Shtub,et al.  Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures , 1997 .

[17]  B. K. Lambert,et al.  Sequence Dependent Machine Set-Up Times and Similarity of Parts: A Mathematical Model , 1988 .

[18]  M. J. Norušis,et al.  Spss/Pc+ V2.0 Base Manual for the IBM Pc/Xt/at and Ps/2 , 1988 .

[19]  G. Boothroyd,et al.  Assembly Automation and Product Design , 1991 .

[20]  David M. Tate,et al.  Genetically improved presequences for euclidean traveling salesman problems , 1994 .

[21]  J. Bard.  A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .

[22]  José Carlos Príncipe,et al.  A Simulated Annealing Like Convergence Theory for the Simple Genetic Algorithm , 1991, ICGA.