Genetic algorithms, path relinking, and the flowshop sequencing problem

Evolutionary Computation

Volumn 6, Issue 1, 1998, Pages 45-60

  Reeves, Colin R ^a   Yamada, Takeshi ^b  

^a Institute for Clean Growth and Future Mobility   (United Kingdom)

^b NTT Communication Science Laboratories   (Japan)

Author keywords

Flowshop sequencing; Genetic algorithms; Landscapes; Path relinking

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; HUMAN; METHODOLOGY; TIME MANAGEMENT;

ALGORITHMS; COMPUTER SIMULATION; HUMANS; TIME MANAGEMENT;

EID: 0032009313     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1998.6.1.45     Document Type: Article

References (33)

1. Beasley, J. (1990). OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41, 1069-1072.
2. Boese, K., Kahng, A., & Muddu, S. (1994). A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16, 101-113.
3. Cartwright, H., & Tuson, A. (1994). Genetic algorithms and flowshop scheduling: Towards the development of a real-time process control system. In T. C. Fogarty (Ed.), Evolutionary computing: AISB workshop, Leeds, UK, April 1994; selected papers (pp. 277-290). Berlin: Springer-Verlag.
4. Culberson, J. (1995). Mutation-crossover isomorphisms and the construction of discriminating functions. Evolutionary Computation, 2, 279-311.
5. Davis, L. (1985). Job shop scheduling with genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications (pp. 136-140). Hillsdale, NJ: Lawrence Erlbaum Associates.
6. Garey, M., & Johnson, D. (1979). Computers and intractibility: A guide to the theory of NP-completeness. San Francisco, CA: W. H. Freeman.
7. Glover, F., & Laguna, M. (1993). Tabu search. In C. R. Reeves (Ed.), Modern beuristic techniques for combinatorialproblems. Oxford: Blackwell Scientific Publications.
8. Goldberg, D., & Lingle, R. (1985). Alleles, loci and the traveling salesman problem. In J.J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications (pp. 154-159). Hillsdale, NJ: Lawrence Erlbaum Associates.
9. Höhn, C., & Reeves, C. (1996a). Are long path problems hard for genetic algorithms? In H. M. Voigt, W. Ebeling, I. Rechenberg, & H.-P. Schwefel (Eds.), Parallel problem-solving from nature-PPSN IV (pp. 134-143). Berlin: Springer-Verlag.
10. Hohn, C., & Reeves, C. (1996b). The crossover landscape for the onemax problem. In J. Alander (Ed.), Proceedings of the Second Nordic Workshop on Genetic Algorithms and Their Applications (pp. 27-43). Vaasa, Finland: University of Vaasa Press.
11. Johnson, D. (1990). Local optimization and the traveling salesman problem. In G. Goos & J. Hartmanis (Eds.), Automata, languages and programming: Lecture notes in computer science 443 (pp. 446-461).
12. Jones, T. (1995). Evolutionary algorithms, fitness landscapes and search. Unpublished dissertation. Albuquerque, NM: University of New Mexico.
13. Kauffman, S. (1993). The origins of order: Self-organisation and selection in evolution. Oxford, UK: Oxford University Press.
14. Nawaz, M., Emscore, E. Jr., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA, 11, 91-95.
15. Nowicki, E. & Smutnicki, C. (1996). A fast tabu search algorithm for the permutation flow-shop problem. European Journal of Operational Research, 91, 160-175.
16. max flowshop problem. Computers and Operations Research, 17, 243-253.
17. Ogbu, F., & Smith, D. (1991). Simulated annealing for the permutation flow-shop problem. OMEGA, 19, 64-67.
18. Osman, I., & Potts, C. (1989). Simulated annealing for permutation flow-shop scheduling. OMEGA, 17, 551-557.
19. Rana, S., & Whitley, D. (1997). Bit representation with a twist. In T. Bäck (Ed.), Proceedings of the Seventh International Conference on Genetic Algorithms (pp. 188-195). San Francisco, CA: Morgan Kaufmann.
20. Reeves, C. (1992). A genetic algorithm approach to stochastic flowshop sequencing. In Proceedings of the IEE Colloquium on Genetic Algorithms for Control and Systems Engineering, London, UK: IEE. Digest No. 1992/106.
21. Reeves, C. (1993). Improving the efficiency of tabu search in machine sequencing problems. Journal of the Operational Research Society, 44, 375-382.
22. Reeves, C. (1994). Genetic algorithms and neighbourhood search. In T. C. Fogarty (Ed.), Evolutionary computing: AISB workshop, Leeds, UK, April 1994; selected papers (pp. 115-130). Berlin: Springer-Verlag.
23. Reeves, C. (1995). A genetic algorithm for flowshop sequencing. Computers and Operations Research, 22, 5-13.
24. Reeves, C. (1998). Landscapes, operators and heuristic search. Annals of Operations Research. To appear.
25. Reeves, C. & Karatza, H. (1993). An experimental investigation of a multi-processor scheduling system. In G. Nemeth (Ed.), Proceedings of a Workshop on Computer Perfonnance Evaluation, Architectures and Scheduling. Budapest, Hungary: Technical University of Budapest.
26. Rinnooy Kan, A. (1976). Machine scheduling problems: Classification, complexity and computations. The Hague: Martinus Nijhoff.
27. Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47, 65-74.
28. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
29. Vaessens, R. (1995). Personal communication.
30. Widmer, M., & Hertz, A. (1989). A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research, 41, 186-193.
31. Yamada, T. & Nakano, R. (1996). Scheduling by genetic local search with multi-step crossover. In H. M. Voigt, W. Ebeling, I. Rechenberg, & H.-P. Schwefel (Eds.), Parallel problem-solving from nature-PPSN IV (pp. 960-969). Berlin: Springer-Verlag.
32. Yamada, T., & Reeves, C. (1997). Permutation flowshop scheduling by genetic local search. In Proceedings of the Second IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems (GALESIA '97) (pp. 232-238). London: IEE.
33. Yamada, T., & Reeves, C. (1998). Distance measures in the permutation flowshop problem. Work in progress.