A genetic algorithm with local search for solving job problems

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

Volumn 1803, Issue , 2000, Pages 107-116

  Cai, L W ^a   Wu, Q H ^b   Yong, Z Z ^a  

^a SHENZHEN UNIVERSITY   (China)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Combined genetic algorithm; Job shop scheduling; Local search

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; GENETIC PROGRAMMING; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION; PROBLEM SOLVING; ROBOT PROGRAMMING; ROBOTICS; SCHEDULING; SIGNAL PROCESSING;

CODING SCHEME; CROSSOVER AND MUTATION; HIGH-EFFICIENCY; JOB SHOP PROBLEM; LOCAL SEARCH; OPTIMAL SOLUTIONS; SIMULATION STUDIES; THOMPSON;

JOB SHOP SCHEDULING;

EID: 79961238244     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45561-2_11     Document Type: Conference Paper

References (14)

1. Coffman, E. G., et al., Computer and Job-Shop Scheduling Theory, U.S.A., John Wiley & Sons, 1976.
2. French, S., Sequencing and Scheduling: An Introduction to The Mathematics of The Job-Shop, England, Ellis Horwood Ltd., 1982.
3. Barker, J. R. and McMahon, G. B., ‘Scheduling the general job shop’, Management Science, 1985, 31 (5), 594-598.
4. Carlier, J. and Pinson, E., ‘An algorithm for solving the job-shop problem’, Management Science, 1989, 35 (2), 164-176.
5. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, 1989.
6. Starkweather, T., et al.., ‘A comparison of genetic sequencing operators’, Proceedings of The Fourth International Conference on Genetic Algorithms, SAN DIEGO, 1991, pp.69-76 41.
7. Bagchi, S., et al., ‘Exploring problem-specific recombination operators for job shop scheduling’, Proceedings of The Fourth International Conference on Genetic Algorithms, SAN DIEGO, 1991, pp.10-17.
8. Cao, Y.J., Wu, Q.H., ‘Mechanical design optimization by mixed-variable evolutionary programming’, Proc. IEEE International Conference on Evolutionary Computation, 1997, Indianapolis, USA, pp.443-446.
9. Wu, Q.H., Cao, Y.J., ‘Stochastic optimization of control parameters in genetic algorithms’, Proc. IEEE International Conference on Evolutionary Computation, 1997, Indianapolis, USA., pp 77-80.
10. Nakano, R. and Yamada, T., ‘Conventional genetic algorithm for job shop problems’, Proceedings of The Fourth International Conference on Genetic Algorithms, SAN DIEGO, 1991, pp.474-479.
11. Federico Della Croce, et al., ‘A genetic algorithm for the job shop problem’, Computers & Operations Research, 1995, 22 (1), 15-24.
12. Shi, G., ‘A genetic algorithm applied to a classic job-shop scheduling problem’, International Journal of Systems Science, 1997, 28 (1), 25-32.
13. Yamada, T. and Nakano, R., ‘A genetic algorithm with multi-step crossover for job shop scheduling problems’, First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications: GALESIA,1st,Sheffield, 1995, pp.146-151.
14. Muth, J. F. and Thompson, G. L., Industrial scheduling, Prentice-Hall, Englewood Cliffs, New Jersey, 1963