Genetic algorithms applied to workshop problems

International Journal of Computer Integrated Manufacturing

Volumn 11, Issue 2, 1998, Pages 183-192

  Fleury, GeéRard ^a   Gourgand, Michel ^b  

^a Laboratoire de Matheématiques Appliqueées   (France)

^b UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0011715971     PISSN: 0951192X     EISSN: 13623052     Source Type: Journal    
DOI: 10.1080/095119298130912     Document Type: Article

References (26)

1. Aarts, E. and Korst, J., 1989, Simulated Annealing and Botzman Machines (Chichester, New York: Wiley).
2. Bagchi, S., Uckun, S., Miyabe, Y and Kawamurea, K., 1991, Exploring problem-specific recombination operators for job-shop scheduling. In R. Belew and L. B. Booker (eds) Proceedings of the 4th International Conference on Genetic Algorithms and their Applications. University of California, San Diego, July 1991 (San Mateo, CA: Morgan Kaufmann Publishers), pp. 10-17.
3. Campbell, H. G., Dudek, R. A. and Smith, M. L., 1970, A Heuristic algorithm for the n jobs, m machines sequencing problem. Management science, 16, 630-637.
4. Catoni, O., 1992, Rough large deviation estimates for simulated annealing: Application to exponential schedules. Annals of Probability, 20, 1109-1146.
5. Chandra, R., 1979, On n/ 1/F dynamic deterministic systems. Naval Review of Logistics Quarterly 26, 537-544.
6. Chu, C. 1991, Minimizing total tardiness with unequal release dates. P. Gritzmann, R. Hettich, R. Horst and E. Sachs (eds). Operations Research’91. Physica-Verlag Heidelberg, Springer-Verlag. pp. 240-243.
7. Chu, C. and Portmann, M. C., 1989, Minimisation de la somme des retards pour les problèmes d’ordonnancement 'a une machine. Rapport de recherche INRIA no. 1023, Rocquen-court (France).
8. Chu, C. and Portmann, M. C., 1990, Single machine scheduling problems with release dates. Rapport de recherche INRIA no. 1232. Rocquencourt (France).
9. Dannenbring, D. G., 1977, An evaluation of flow-shop sequencing heuristics. Management science, 23, 1174-1182.
10. Davis, L., 1985, Job shop scheduling with genetic algorithms. Proceedings of an International Conference on Genetic Algorithms and their Applications, July 1985 (Hillsdale, J: Lawrence Erlbaum Associates), pp. 136-140.
11. Davis, L., 1987, Handbook of Genetic Algorithms. (Reimhold, New York: Van Nostrand).
12. De Jong, K. A. and Spears, W., 1989, Using genetic algorithms to solve NP-complete problems. in J. Schaeffer (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, June 1989 (San Mateo, CA: Morgan Kauffman Publishers), pp. 124-132.
13. Dessouky, M. I. and Deogun, J. S., 1981, Sequencing jobs with unequal ready times to minimize mean flow-time. Siam Journal Computers 10, 192-202.
14. Fleury, G., 1991, Simulated annealing for scheduling in manufacturing systems. P. Gritzmann, R. Hettich, R. Horst and E. Sachs (eds) Operations Research '91. Physica-Verlag Heidelberg, Springer-Verlag. pp. 244-248.
15. Fleury, G., 1993, Méthodes stochastiques et déterministes pour les problèmes NP-difficiles. These. Univ. Blaise Pascal. Clermont-Ferrand (France).
16. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability (Freeman & Co., New-Ybrk).
17. Goldberg, D. E., 1989, Genetic Algorithms in Search Optimization and Machine Learning. (Reading, MA: Addison Wesley).
18. Hajek, B., 1988, Optimization by simulated annealing, a necessary and sufficient condition for convergence. Lecture notes. Monograph series., Vol 8. Institute of mathematical statistics, Hayvar, California, pp. 417-427.
19. Han, W. and Dejax, P., 1990, Une heuristique pour le probleme d’ordonnancement de type n/m// F/ Cmax avec la présence de machines goulots. RAIRO Recherche Oper-ationnelle, 24, 315-330.
20. Lawler, E. L., Lenstra, J. K., RinnooyKan, A. H. G. and Shmoys, D. B., 1989, Sequencing and scheduling: Algorithms and complexity. Report BS-R89xx, Centrumvoor Wiskunde enInformatica, Amsterdam (NL).
21. Nawaz, M., Enscore, E. E. and Ham, I. L., 1983, A heuristic algorithms for the n jobs, m machines sequencing problem. Omega, 22, 127-141.
22. Proust, C., 1992, Using Johnson’s algorithm for solving flow-shop problems. Ecole d’ete sur la theorie de l’ordonnancement et ses applictions. pp. 297-342. INRIA.
23. Shapiro, S. S. and Wilk, M. B., 1965, An analysis of variance test for normality (complete samples). Biometrika, 52, 591-611.
24. Whitley, D. and Starkweather, T., 1990, Genitor II: A distributed genetic algorithm. Journal of Experimental & Theoretical Artificial Intelligence, 2, 189-214.
25. Whitley, D., Starkweather, T. and Fuquay, D., 1989, Scheduling problems and travelling salesman: The genetic edge recombination operator. In J. Schaefer (ed.) Proceedings of the 3rd International Conference on Genetic Algorithms, June 1989 (San Mateo, CA: Morgan Kauffman Publishers), pp. 133-140.
26. Widmer, M., 1990, Mod'eles mathématiques pour une gestion efficace des probl'emes d’ateliers flexibles. These. Ecole Polytechnique Fédérale de Lausanne.