Flowshop Scheduling by Genetic Algorithm and Its Application to Multi-Objective Problems
暂无分享,去创建一个
Hideo Tanaka | Hisao Ishibuchi | Tadahiko Murata | Hideo Tanaka | H. Ishibuchi | Hideo Tanaka | T. Murata
[1] Hideo Tanaka,et al. Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems , 1994 .
[2] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[3] A. Hertz,et al. A new heuristic method for the flow shop sequencing problem , 1989 .
[4] Dirk Van Gucht,et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem , 1989 .
[5] L. D. Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.
[6] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[7] J. D. Schaffer,et al. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms , 1985, ICGA.
[8] Nostrand Reinhold,et al. the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .
[9] L. Darrell Whitley,et al. A Comparison of Genetic Sequencing Operators , 1991, ICGA.
[10] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .