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

Computers and Industrial Engineering

Volumn 37, Issue 1, 1999, Pages 51-55

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

^a NORTHEASTERN UNIVERSITY   (China)

^b ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; SCHEDULING;

COMBINATORIAL OPTIMIZATION; HYBRID HEURISTICS; JOB SHOP SCHEDULING PROBLEM;

GENETIC ALGORITHMS;

EID: 0032599591     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00022-4     Document Type: Article

References (16)

1. Cheng, R., M. Gen, and Y. Tsujimura, A tutorial survey of job-shop scheduling problems using genetic algorithms: Part I. representation, International Journal of Computers and Industrial Engineering, vol.30, pp.983-997, 1996.
2. Gen, M. and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, New York, 1997.
3. Goldberg, D. and R. Lingle, Alleles, Loci and the traveling salesman problem, In Grefenstette, J. J., editor, Proc. of 1st ICGA, pp. 154-159, 1985.
4. Davis, L., Applying adaptive algorithms to epistatic domains, In Proc. of the Inter. Joint Conf. on Artificial Intelligence, pp. 162-164, 1985.
5. Oliver, I., D. Smith, and J. Holland, A study of permutation crossover operators on the traveling salesman problem, In Grefenstette, J. J., editor, Proc. of 2nd ICA, Pp. 224-230, 1987.
6. Falkenauer, E. and S. Bouffoix, A genetic algorithm for job shop, In Proc. 1991 IEEE Inter. Conf. on Robotics and Automation, pp. 824-829, 1991.
7. Kobayashi, S., I. Ono, and M. Yamamura, An efficient genetic algorithm for job shop scheduling problems, In Eshelman, L. J., editor, Proc. of the 6th ICGA, pp. 506-511, 1995.
8. Ono, I., M. Yamamura, and S. Kobayashi, A genetic algorithms for job-based order crossover, In Fogel, D., editor, Proc. of 3rd IEEE Conf. on Evolutionary Computation, pp. 547-552, IEEE Press, Japan, 1996.
9. Gen, M., Y. Tsujimura, and E. Kubota, Solving job-shop scheduling problem using genetic algorithms, In Gen, M. and T. Kobayashi, editors, Proc. of 16th Inter. Conf. on Computer and Industrial Engineering, pp. 576-579, Ashikaga, Japan, 1994.
10. Cheng, R., A Study on Genetic Algorithms-based Optimal Scheduling Techniques, PhD thesis, Tokyo Institute of Technology, 1997.
11. Yamada, T. and R. Nakano, A genetic algorithm applicable to large-scale job-shop problems, In Männer, R. and B. Manderick, editors, Proc. of 2nd Inter. Conf. on Parallel Problem Solving from Nature, pp. 281-290, 1992.
12. Tsujimura, Y., R. Cheng, and M. Gen, Improved genetic algorithms for job-shop scheduling problems, Engineering Design & Automation, vol.3, no.2, pp.133-144, 1997.
13. Dorndorf, U. and E. Pesch, Evolution based learning in a job shop scheduling environment, Computers and Operations Research, vol.22, no.1, pp.25-40, 1995.
14. Baker, K., Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, 1974.
15. Adams, J., E. Balas, and D. Zawack, The shifting bottleneck procedure for job shop scheduling, International Journal of Flexible Manufacturing Systems, vol.34, no.3, pp.391-401, 1988.
16. Holsapple, C., V. Jacob, R. Pakath, and J. Zaveri, A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts, IEEE Transactions on Systems, Man, and Cybernetics, vol.23, pp.953-971, 1993.