Solving a concrete sleepers production scheduling by genetic algorithms

European Journal of Operational Research

Volumn 179, Issue 3, 2007, Pages 605-620

  Perez Vazquez M E ^a   Gento Municio, A M ^a   Lourenco H R ^b  

^a UNIVERSIDAD DE VALLADOLID   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Deterministic crowding; Genetic algorithms; Multiobjective; Scheduling

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; PROBLEM SOLVING; SCHEDULING;

DEMAND SATISFACTION; DETERMINISTIC CROWDING; MULTIOBJECTIVE; PRODUCTION CAPACITY;

CONCRETES;

EID: 33845925039     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.03.070     Document Type: Article

References (28)

1. Bagchi T.P. Multiobjective Scheduling by Genetic Algorithms (1999), Kluwer Academic Publishers
2. Baker, J.E., 1985. Adaptive selection methods for genetic algorithms. In: Gefenstette, J.J. (Ed.), Proceedings of the first International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaum, New Jersey, pp. 101-111.
3. Beasley D., Bull D.R., and Martin R.R. A sequential niche technique for multimodal function optimization. Evolutionary Computation 1 2 (1993) 101-125
4. Brucker. Scheduling Algorithms (1998), Springer
5. Chrétienne, P., Coffman Jr., E.G., Lenstra, J.K., Liu, Z. (Eds.), 1995. Scheduling Theory and its Applications. John Wiley.
6. Davis, L. (Ed.), 1991. Handbook of Genetics Algorithms. Van Nostrand, New York.
7. Deb K. Multi-objective Optimization using Evolutionary Algorithms (2001), John Wiley
8. Escalada-Imaz G., and Torres-Velázquez R. Algoritmos genéticos genéricos y basados en orden. Conceptos fundamentales y mecanismo de base. Inteligencia Artificial 3 (1997)
9. Fang, H., 1994. Genetic algorithms in timetabling and scheduling. Doctoral Dissertation, Department of Artificial Intelligence, University of Edinburg.
10. French S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop (1982), Ellis Horwood
11. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers
12. Goldberg D., and Richardson J. Genetic algorithms with sharing for multimodal function optimization. In: Grefensette J. (Ed). Proceedings of the Second International Conference on Genetic Algorithms (1987), Lawrence Erlbaum 41-49
13. Grefenstette J., Gopal R., Rosmaita B., and Gucht D.V. Genetic algorithms for the traveling salesman problem. In: Grefenstette J. (Ed). Proceedings of the First International Conference on Genetic Algorithms and their Applications (1985), Lawrence Erlbaum, New Jersey 160-168
14. Horn J., Nafpliotis N., and Goldberg D. A niched pareto genetic algorithm for multiobjective optimization. Proceedings of the first IEEE Conference on Evolutionary Computation 1 (1994) 82-87
15. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
16. Lourenço H.R., Martin O.C., and Stützle T. Iterated Local Search. In: Glover F., and Kochenberger G. (Eds). The Handbook of Metaheuristics Book (2003), Kluwer Academic Publishers, USA 321-353
17. Mahfoud S.W. Crowding and preselection revisited. In: Männer R., and Manderick B. (Eds). Parallel Problem Solving from Nature II (1992), Elsevier, Amsterdam 27-36
18. Mahfoud, S.W., 1995. Niching methods for genetic algorithms. Ph.D. Dissertation, University of Illinois, Urbana-Champaign.
19. Mattfeld D.C. Evolutionary Search and the Job Shop. Investigations on Genetic Algorithms for Production Scheduling (1995), Springer
20. Morton T., and Pentico D. Heuristic Scheduling Systems (1993), John Wiley
21. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (1995), Springer, Berlin
22. Oei, C.K., Goldberg, D.E., Chang, S.J., 1991. Tournament selection, niching and the preservation of diversity. IlliGAL Report No. 91011, University of Illinois at Urbana-Champaign.
23. Pérez E., Herrera F., and Hernández C. Finding multiple solutions in job shop scheduling by niching genetic algorithms. Journal of Intelligent Manufacturing 14 3-4 (2003) 223-239
24. Pétrowski, A., 1996. Clearing procedure as a niching method for genetic algorithms. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, Nagoya, Japan, pp. 798-803.
25. Pinedo M., and Chao X. Operations Scheduling with Applications in Manufacturing and Services (1999), McGraw-Hill
26. Van Laarhoven P.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by simulated annealing. Operations Research 40 (1992) 112-129
27. Wang L., and Zheng D.-Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research 28 (2001) 585-596
28. Whitley L.D., Starkweather T., and Fuquay D.A. Scheduling problems and travelling salesmen: The genetic edge recombination. In: David Schaffer J. (Ed). Proceedings of the Third International Conference on Genetic Algorithms (1989), Kaufmann, San Mateo 133-140