Climbing Up NP-Hard Hills
暂无分享,去创建一个
[1] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[2] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[3] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[4] Erwin Pesch,et al. Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..
[5] Kenneth Steiglitz,et al. On the Complexity of Local Search for the Traveling Salesman Problem , 1977, SIAM J. Comput..
[6] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[7] Takeshi Yamada,et al. A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.
[8] Bernard Penz. Constructions agrégatives d'ordonnancements pour des jobs-shops statiques, dynamiques et réactifs. (Aggregation methods for static, dynamic and reactive job-shops) , 1994 .
[9] Philippe Preux,et al. Assessing the evolutionary algorithm paradigm to solve hard problems , 1995 .
[10] C. Soares. Evolutionary computation for the job-shop scheduling problem , 1994 .
[11] Peter Ross,et al. A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.
[12] Takeshi Yamada,et al. Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.
[13] A. Hertz,et al. La méthode TABOU appliquée aux problèmes d'ordonnancement , 1995 .
[14] Martin Wattenberg,et al. Stochastic Hillclimbing as a Baseline Mathod for Evaluating Genetic Algorithms , 1995, NIPS.
[15] P.,et al. Parallel Hybrid MetaHeuristics : Application to the Quadratic Assignment , 1996 .
[16] El-Ghazali Talbi. Allocation de processus sur les architectures parallèles à mémoire distribuée , 1993 .
[17] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[18] Isao Ono,et al. An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.