The effect of various operators on the genetic search for large scheduling problems

International Journal of Production Economics

Volumn 88, Issue 2, 2004, Pages 191-203

  Nearchou, Andreas C ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Combination; Flow shop scheduling; Genetic algorithms; Genetic operators

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBABILITY; SCHEDULING; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM;

CROSSOVER COMBINATION; FLOW-SHOP SCHEDULING; GENETIC OPERATORS; SCHEDULING PROBLEMS;

MATHEMATICAL OPERATORS;

EID: 1342264261     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(03)00184-1     Document Type: Conference Paper

References (21)

1. Cambell H., Dudek R., Smith M. A heuristic algorithm for the n-job, m-machine sequencing problem. Management Science. 16/B:1970;630-637.
2. Chen C.-L., Neppalli R.V., Aljaber N. Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering. 30(4):1996;919-929.
3. Dannenbring D. An evaluation of flow shop sequencing heuristics. Management Science. 23:1977;1174-1182.
4. Gen M., Cheng R. Genetic Algorithms and Engineering Design. 1997;Wiley, NewYork.
5. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning. 1989;Addison-Wesley, Reading, MA.
6. Gupta J. A functional heuristic algorithm for the flow shop scheduling problem. Operations Research Quarterly. 22:1971;39-47.
7. Holland J.H. Adaptation in Natural and Artificial Systems. 1992;University of Michigan Press, Ann Arbor, MI.
8. Ishibuchi H., Misaki S., Tanaka H. Modified simulated annealing algorithms for the flow shop sequencing problem. European Journal Operational Research. 81:1995;388-398.
9. Johnson S.M. Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly. 1:1954;61-68.
10. Michalewicz Z., Fogel D.B. How to Solve it. Modern Heuristics. 2000;Springer, Germany.
11. Murata T., Ishibuchi H., Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering. 30(4):1996;1061-1071.
12. Nawaz M., Enscore E., Ham I. A heuristic for the m-machine n-job flow shop sequencing problem. Omega. 11:1983;91-95.
13. max flow shop problem. Computers and Operations Research. 17(3):1990;243-253.
14. Osman I.H., Potts C.N. Simulated annealing for permutation flow-shop scheduling. Omega. 17(6):1989;551-557.
15. Palmer D. Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near optimum. Operations Research Quarterly. 16:1965;101-107.
16. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research. 22(1):1995;5-13.
17. Rinnooy Kan A.H.G. Machine Scheduling Problems. Classification, Complexity and Computations:1976;Martinus Nijhoff, The Hague.
18. Spears W.M. Adapting crossover in evolutionary algorithms. McDonnell J.R., Reynolds R.G., Fogel D.B. Proceedings of the Fourth Annual Conference on Evolutionary Programming. 1995;367-384 MIT Press, Cambridge, MA.
19. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research. 47:1990;65-74.
20. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research. 64:1993;278-285.
21. Yoon H.-S., Moon B.-Ro. An empirical study on the synergy of multiple crossover operators. IEEE Transactions on Evolutionary Computation. 6(2):2002;212-223.