论文信息 - A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems - 字舞流文

A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems

Peter Ross | David W. Corne | Hsiao-Lan Fang | D. Corne | P. Ross | H. Fang

[1] Ralph R. Martin,et al. Reducing Epistasis in Combinatorial Problems by Expansive Coding , 1993, ICGA.

[2] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[3] L. D. Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, ICGA.

[4] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .

[5] Lawrence Davis,et al. Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[6] Sushil J. Louis,et al. Case-based reasoning assisted explanation of genetic algorithm results , 1993, J. Exp. Theor. Artif. Intell..

[7] Takeshi Yamada,et al. Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.

[8] Nicholas J. Radcliffe,et al. Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

[9] Larry J. Eshelman,et al. Preventing Premature Convergence in Genetic Algorithms by Preventing Incest , 1991, ICGA.

[10] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .

[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .