Genetic algorithms applied to assembly operations

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 2244, Issue , 1994, Pages 32-42

  Underbrink, A J ^a   Williams, George P W ^a  

^a BOEING COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHROMOSOMES; KNOWLEDGE BASED SYSTEMS; SCHEDULING;

ASSEMBLY LINE; ASSEMBLY OPERATIONS; ASSEMBLY TASKS; GENETIC OPERATORS; PRODUCTION LINE; SCHEDULING SYSTEMS; SKILL LEVELS;

GENETIC ALGORITHMS;

EID: 85030052800     PISSN: 0277786X     EISSN: 1996756X     Source Type: Conference Proceeding    
DOI: 10.1117/12.169405     Document Type: Conference Paper

References (36)

1. K. R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, 1974.
2. James C. Bean. Genetics and random keys for sequencing and optimization. Technical Report 92-43, Department of Industrial & Operations Engineering, University of Michigan, Ann Arbor, June 1992.
3. Richard K. Belew and Lashon B. Booker, editors. Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, California, 1991. Morgan Kaufmann.
4. D. E. Brown and C. C. White, editors. Operations Research/Artifical Intelligence: The Integration of Problem Solving Strategies. Kluwer Academic Publishers, Boston, 1990.
5. Lawrence Davis, editor. Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York, 1991.
6. Lawrence Davis, David Orvosh, Anthony Cox, and Yuping Qiu. A genetic algorithm for survivable network design. In Forrest, 10 pages 408-415.
7. Kalyanmoy Deb and David E. Goldberg. An investigation of niche and species formation in genetic function optimization. In Schaffer, 31 pages 42-50.
8. E. Falkenauer and S. Bouffouix. A genetic algorithm for job shop. In Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 20 pages 824-829. Sacramento, California.
9. Carlos M. Fonseca and Peter J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In Forrest, 10 pages 416-423.
10. Stephanie Forrest, editor. Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, California, 1993. Morgan Kaufmann.
11. M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
12. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 13:533-549, 1986.
13. F. Glover. Tabu search - part 1. ORSA Journal of Computation, 1:190-206, 1989.
14. David E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, New York, 1989.
15. David E. Goldberg, Kalyanmoy Deb, and Bradley Korb. Don't worry, be messy. In Belew and Booker, 3 pages 24-30.
16. David E. Goldberg and Robert Lingle, Jr. Alleles, loci, and the traveling salesman problem. In Grefenstette, 18 pages 154-159.
17. V. Scott Gordon and Darrell Whitley. Serial and parallel genetic algorithms as function optimizers. In Forrest, 10 pages 177-183.
18. John J. Grefenstette, editor. Proceedings of the First International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaurn Associates, 1985.
19. John H. Holland. Adaptation in Natural and Artificial Systems. The MIT Press, Cambridge, 1991. Revised from the 1975 edition.
20. IEEE. Proceedings of the 1991 IEEE International Conference on Robotics and Automation, April 1991. Sacramento, California.
21. Kate Juliff. A multi-chromosome genetic algorithm for pallet loading. In Forrest, 10 pages 467-473.
22. S. Kirkpatrick, C. D. Jelatt, and M. P. Vecchi. Optimisation by simulated annealing. Science, 220:671-679, 1983.
23. G. E. Liepins, M. R. Hilliard, J. Richardson, and M. Palmer. Genetic algorithm applications to set covering and traveling salesman problems. In Brown and White, 4 pages 29-57.
24. S. Lin. Computer solutions of the traveling salesman problem. Bell Systems Technical Journal, 44:2245-2269, 1965.
25. Sushil J. Louis and Gregory J. E. Rawlins. Pareto optimality, ga-easiness and deception. In Forrest, 10 pages 118-123.
26. H. Mülenbein, M. Schomisch, and J. Born. The parallel genetic algorithm as function optimizer. In Belew and Booker, 3 pages 271-278.
27. Ryohei Nakano and Takeshi Tamada. Conventional genetic algorithm for job shop problems. In Belew and Booker, 3 pages 474-479.
28. David Orvosh and Lawrence Davis. Shall we repair? genetic algorithms, combinatorial optimization, and feasibility constraints. In Forrest, 10 page 650.
29. James H. Patterson. A comparison of exact approaches for solving the multiple constrainted resource project scheduling problem. Management Science, 30(7):854-867, July 1984.
30. Nicholas J. Radcliffe. Forma analysis and random respectful recombination. In Belew and Booker, 3 pages 222-229.
31. J. David Schaffer, editor. Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, California, 1989. Morgan Kaufmann.
32. R. Shonkwiler. Parallel genetic algorithms. In Forrest, 10 pages 199-205.
33. Gilbert Syswerda. Uniform crossover in genetic algorithms. In Schaffer, 31 pages 2-9.
34. Gilbert Syswerda. Schedule optimization using genetic algorithms. In Davis, 5 chapter 21, pages 332-349.
35. David M. Tate and Alice E. Smith. Expected allele coverage and the role of mutation in genetic algorithms. In Forrest, 10 pages 31-37.
36. D. Whitley and J. Kauth. GENITOR: A different genetic algorithm. In Proceedings of the Rocky Mountain Conference on Artificial Intelligence, 1988.