Multirecombinated evolutionary algorithms for the flow shop scheduling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1917, Issue , 2000, Pages 264-272

  Esquivel, Susana C ^a   Zuppa, Federico ^a   Gallard, Raúl H ^a  

^a UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

CONVENTIONAL APPROACH; EVOLUTIONARY APPROACH; FLOW SHOP PROBLEMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; MULTIPLE CROSSOVER; MULTIRECOMBINATION; PARTIAL REPLACEMENT;

MACHINE SHOP PRACTICE;

EID: 23044522572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_26     Document Type: Conference Paper

References (16)

1. Campbell H., Dudek R., Smith M.: A heuristic algorithm for the n job m machine sequencing problem, Management Science 16, 1970, 630-637.
2. Chen C, Vempati V., Aljaber N.: An application of genetic algorithms for flow shop problems, European Journal Of Operational Research, vol 80, pp 389-396, 1995.
3. De Jong K. A.: Analysis of the Behavior of a Class of Genetic Adaptive Systems, PhD Dissertation, University of Michigan, 1975.
4. Esquivel S., Gallard R., Michalewicz Z..MCPC: Another Approach to Crossover in Genetic Algorithms, Proceeding of Primer Congreso Argentino de Ciencias de la Computacin, pp 141-150, 1995.
5. Esquivel S., Leiva A., Gallard R.: Multiple Crossover per Couple in Genetic Algorithms, Proceedings of the Fourth IEEE Conference on Evolutionary Computation (ICEC’97), pp 103-106, ISBN 0-7803-3949-5, Indianapolis, USA, April 1997.
6. Esquivel S, Leiva H, Gallard R.: Multiple crossovers between multiple parents to improve search in evolutionary algorithms, Proceedings of the 1999 Congress on Evolutionary Computation (IEEE). Washington DC, pp 1589-1594.
7. Gupta J.: A functional heuristic algorithm for the flowshop scheduling problem, Operational Research Quarterly 22, 1971,39-48,.
8. Johnson S.: Optimal two and three stage production schedule with setup times included, Naval Research Logistic Quarterly, vol 1, pp 61-68.1954.
9. Morton T., Pentico D.: Heuristic scheduling systems, Wiley series in Engineering and technology management. John Wiley and Sons, INC, 1993.
10. Nawaz M., Enscore E., Ham I.: A heuristic algorithm for the m-machine n-job flow shop sequencing problem. Omeea vol 2, pp 11-95, 1983.
11. Palmer D.: Sequencing jobs through a multistage process in the minimum total time-A quick method of obtaining a near optimum, Operational Research Quarterly 16, 101-107, 1965.
12. Reeves C: A genetic algorithm for flow shop sequencing, Computers and Operations Research, vol 22, pp5-13, 1995.
13. Sannomiya N., lima H, Applications of genetic algorithms to scheduling problems in manufacturing process, Proceedings of the First IEEE Conference on Evolutionary Computation, Nagoya, Japan, pp 523-528, 1996.
14. Schaffer J., Caruana R., Eshelman R., Das R.: A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization, in Third International Conference on Genetic Algorithms, pages 51-60, 1989.
15. Taillard E.: Benchmarks for basic scheduling problems, European Journal of Operational Research, vol 64, pp 278-285, 1993. (http://www.idsia.cli/eric/problctnes.dir/ordonnaiicement.dir/ordoniianceiiient.htiiil)
16. Tsujimura Y., Gen M., Kubota E.: Flow shop scheduling with fuzzy processing time using genetic algorithms. The 11th Fuzzy Systems Symposium pp 248-252. Okinawa. 1995.