Tutorial survey of job-shop scheduling problems using genetic algorithms, Part II: hybrid genetic search strategies

Computers and Industrial Engineering

Volumn 36, Issue 2, 1999, Pages 343-364

  Cheng, Runwei ^a   Gen, Mitsuo ^b   Tsujimura, Yasuhiro ^b  

^a Department of Chemistry   (China)

^b ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; FLEXIBLE MANUFACTURING SYSTEMS; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; STRATEGIC PLANNING;

COMBINATORIAL OPTIMIZATION PROBLEMS; HYBRID HEURISTICS; JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0032592184     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00136-9     Document Type: Article

References (34)

1. Baker K. Introduction to sequencing and scheduling. 1974;John Wiley & Sons, New York.
2. Broucker P. Scheduling algorithms. 2nd ed. 1998;Springer-Verlag, Berlin.
3. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job-shop problem. Management Sciences. 42:(6):1996;797-813.
4. Cheng R., Gen M., Tsujimura Y. A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: representation. International Journal of Computers and Industrial Engineering. 30:1996;983-997.
5. Michalewicz Z. Genetic algorithm+data structure=evolution programs. 2nd ed. 1994;Springer-Verlag, New York.
6. Gen M., Cheng R. Genetic algorithms and engineering design. 1997;John Wiley & Sons, New York.
7. Davis L. Handbook of genetic algorithm. 1991;Van Nostrand Reinhold, New York.
8. Renders J., Bersini H. Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. Fogel D. Proceedings of the First IEEE Conference on Evolutionary Computation. 1994;312-317 IEEE Press, FL.
9. Goldberg D., Lingle R. Alleles, Loci and the traveling Salesman Problem. Grefenstette J.J. Proceedings of the First International Conference on Genetic Algorithms. 1985;154-159 Lawrence Erlbaum Associates, Hillsdale, NJ.
10. Davis L. Applying adaptive algorithms to epistatic domains. Proceedings of the International Joint Conference on Artificial Intelligence. 1985;162-164.
11. Syswerda G. Uniform crossover in genetic algorithms. Schaffer J. Proceedings of the Third International Conference on Genetic Algorithms. 1989;2-9 Morgan Kaufmann Publishers, San Mateo, CA.
12. Oliver I., Smith D., Holland J. A study of permutation crossover operators on the traveling salesman problem. Grefenstette J.J. Proceedings of the Second International Conference on Genetic Algorithms. 1987;224-230 Lawrence Erlbaum Associates, Hillsdale, NJ.
13. Falkenauer E., Bouffoix S. A genetic algorithm for job shop. Proceedings of the 1991 IEEE International Conference on Robotics and Automation. 1991;824-829.
14. Kobayashi S., Ono I., Yamamura M. An efficient genetic algorithm for job shop scheduling problems. Eshelman L.J. Proceedings of the Sixth International Conference on Genetic Algorithms. 1995;506-511 Morgan Kaufmann Publishers, San Francisco, CA. July 1995.
15. Brady R. Optimization strategies gleaned from biological evolution. Nature. 317:(31):1985;804-806.
16. Mühlenbein H, Schlouter M, Kraemer O. Evolution algorithms in combinatorial optimization, Parallel Computing 7.
17. Ono I., Yamamura M., Kobayashi S. A genetic algorithms for job-based order crossover. Fogel D. Proceedings of the Third IEEE Conference on Evolutionary Computation. 1996;547-552 IEEE Press, Japan.
18. Gen M., Tsujimura Y., Kubota E. Solving job-shop scheduling problem using genetic algorithms. Gen M., Kobayashi T. Proceedings of the 16th International Conference on Computer and Industrial Engineering. 1994;576-579 Ashikaga, Japan.
19. Holland J. Adaptation in natural and artificial systems. 1975;University of Michigan Press, Ann Arbor.
20. Cheng R. A study on genetic algorithms-based optimal scheduling techniques, PhD thesis, Tokyo Institute of Technology, 1997.
21. Yamada T., Nakano R. A genetic algorithm applicable to large-scale job-shop problems. Männer R., Manderick B. Proceedings of the Second International Conference on Parallel Problem Solving from Nature. 1992;281-290 Elsevier Science Publishers, North-Holland.
22. Tsujimura Y., Gren M. Parts loading scheduling in a flexible forging machine using an advanced genetic algorithm. Journal of Intelligent Manufacturing. 10:(2):1999;149-156.
23. Kennedy S. Five ways to a smarter genetic algorithm, AI Expert 1993:35-38.
24. Moscato P., Norman M. A memetic approach for the travelling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems. Proceedings of the International Conference on Parallel Computing and Transputer Applications. 1992;. Amsterdam.
25. Fogarty T. Evolutionary computing. 1994;Springer-Verlag, Berlin.
26. Dorndorf U., Pesch E. Evolution based learning in a job shop scheduling environment. Computers and Operations Research. 22:(1):1995;25-40.
27. Storer R, Wu S, Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Science 1992;38(10):1495-1510.
28. Panwalker S., Iskander W. A survey of scheduling rules. Operations Research. 25:1977;45-61.
29. Haupt R. A survey of priority-rule based scheduling problem. OR Spektrum. 11:1989;3-16.
30. Blackstone J., Phillips D., Hogg G. A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Researches. 20:1982;27-45.
31. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. International Journal of Flexible Manufacturing Systems. 34:(3):1988;391-401.
32. Applegate D., Cook W. A computational study of the job shop scheduling problem. ORSA Journal of Computing. 3:(2):1991;149-156.
33. Holsapple C., Jacob V., Pakath R., Zaveri J. A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts. IEEE Transactions on Systems, Man, and Cybernetics. 23:1993;953-971.
34. Gen M., Cheng R. Genetic algorithms and engineering optimization. 1999;John Wiley & Sons, New York.