A genetic algorithm approach to scheduling PCBs on a single machine

International Journal of Production Research

Volumn 36, Issue 3, 1998, Pages 761-784

  Maimon, O Z ^a   Braha, D ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PERFORMANCE; PRINTED CIRCUIT MANUFACTURE; SCHEDULING;

PRINTED CIRCUIT BOARDS;

EID: 0032021554     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498193688     Document Type: Article

References (26)

1. Bard, S. J., 1988, A heuristic for minimizing the number of tool switching on a flexible machine. IIE Transactions, 20, 382-391.
2. Boothroyd, G., 1992, Assembly Automation and Product Design (New York: Marcel Dekker).
3. Charles-Owaba, O. C., and Lambert, B. K., 1988, Sequence dependent machine set-up times and similarity of parts: a mathematical model. IIE Transactions, 20, 12-21.
4. Coombs, C. F., 1988, Printed Circuits Handbook (New York: McGraw-Hill).
5. Cunningham, P., and Browne, J., 1986, A lisp based heuristic scheduler automatic insertion in electronic assembly. International Journal of Production Research, 24 (6), 1395-1408.
6. Daskin, M., Maimon, O., Shtub, A., and Braha, D., 1996, Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedures. International Journal of Production Research, 35 (6), 1617-1638.
7. Davis, T. E., and Principe, J. C., 1991, A simulated annealing like convergence theory for the genetic algorithm. Proceedings of the International Conference on Genetic Algorithms, pp. 174-181.
8. Foo, F. C., and Wagner, J. G., 1983, Set-up times in cyclic and acyclic group technology scheduling systems. International Journal of Production Research, 21, 63-73.
9. Goldberg, D. E., 1989, Genetic Algorithms in Search Optimization and Machine Learning (New York: Addison-Wesley).
10. Grefenstette, J. J., 1986, Optimization of control parameters for genetic algorithms. IEEE Transactions on Man, Machine and Cybernetics, 16 (1), 122-128.
11. Grefenstette, J. J., Gopal, R., Rosamita, B., and van Gucht, D., 1985, Genetic algorithms for the traveling salesman problem. Proceedings ofan International Conference on Genetic Algorithms and Their Applications (Pittsburgh: Carnegie-Mellon University).
12. Holland, J. H., 1975, Adaptation in Natural and Artificial Systems (Ann Arbor: University of Michigan Press).
13. Jog, P., Jung, Y. S., and Gucht, D. V., 1991, Parallel genetic algorithms applied to the travelling salesman problem. SIAM Journal on Optimization, pp. 515-529.
14. Kear, F. W., 1987, Printed Circuit Assembly Manufacturing (New York: Marcel Dekker).
15. Kruskal, J. B., 1956, On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 48-50.
16. Lofgren, C. B., and McGinnis, L. F., 1986, Dynamic scheduling for flexible FCC assembly. IEEE (ICSMC v.2), pp. 1294-1297.
17. Marija, N. J., 1994a, SPSS/PC+ V2.0 Base Manual (Chicago, Illinois: SPSS Inc.).
18. Marija, N. J., 1994b, SPSS/PC+ Advanced Statistics V2.0 (Chicago, Illinois: SPSS Inc.).
19. Oliver, I. M., Smith, D. J., and Holland, J. R. C., 1987, A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms and Their Applications.
20. Ozden, M., Egbelu, P. J., and Iyer, A. V., 1985, Job scheduling in a group technology environment for a single facility. Computers and Industrial Engineering, 9, 67-72.
21. Ross, P. J., 1988, Taguchi Techniques for Quality Engineering (New York: McGraw-Hill).
22. Storer, R. H., Wu, S. D., and Vaccari, R., 1992, New search spaces for sequencing problems with application to job shop scheduling. Management Science, 38, 1495-1509.
23. Tang, C. S., and Denardo, E. V., 1988a, Models arising from a flexible manufacturing machine, part I: minimization of the number of tool switches. Operations Research, 36 (5), 767-777.
24. Tang, C. S., and Denardo, E. V., 1988b, Models arising from a flexible manufacturing machine, part I: minimization of the number of switching instants. Operations Research, 36 (5), 778-784.
25. Tate, D. M., Tunasar, C., and Smith, A. E., 1994, Genetically improved presequences for Euclidean traveling salesman problems. Mathematical and Computer Modeling, 20 (2), 135-143.
26. White, C. H., and Wilson, R. C., 1977, Sequence-dependent set-up times andjob sequencing. International Journal of Production Research, 15, 191-202.