Climbing up NP-hard hills

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

Volumn 1141, Issue , 1996, Pages 574-583

  Duvivier, D ^a   Preux, Ph ^a   Talbi, E G ^b  

^a UNIVERSITÉ DU LITTORAL CÔTE D OPALE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ECONOMIC AND SOCIAL EFFECTS; EVOLUTIONARY ALGORITHMS; JOB SHOP SCHEDULING; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION;

FITNESS LANDSCAPE; HILL CLIMBING ALGORITHMS; HYBRID ALGORITHMS; JOB SHOP SCHEDULING PROBLEMS; LOCAL SEARCH ALGORITHM; LOCAL SEARCH METHOD; OBJECTIVE FUNCTIONS; SEARCH ALGORITHMS;

PROBLEM SOLVING;

EID: 84958961147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_1021     Document Type: Conference Paper

References (18)

1. Vincent Bachelet, Philippe Preux and EI-Ghazali Talbi. Parallel Hybrid Meta- Heuristics: Application to the Quadratic Assignment Problem. Proc. of the Parallel Optimization Colloquium, Versailles, France, March 1996.
2. J.E. Beasley. OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069-1072, 1990. acces to the library via anonymous ftponmscmgamsicac.uk:/pub.
3. J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Science, 35(2):164-176, 1989.
4. U. Dorndorf and E. Pesh. Evolution-based learning in a job shop scheduling environment. Technical Report RM 92-019, Rijksuniversiteit Limburg, The Netherlands, 1992.
5. Hsiao-Lan Fang, Peter Ross, and Dave Come. A promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling problems. In Stephanie Forrest, editor. Proc. of the Fifth International Conference on Genetic Algorithms, Urbana-Champaign, IL, USA, July 1993. Morgan Kaufmarm, San Mateo, CA, USA, pages 488-493.
6. F. Glover. Tabu search -- part I. ORSA Journal of Computing, 1(3):190-206, 1989.
7. F. Glover. Tabu search -- part II. ORSA Journal of Computing, 2(1):4-31, 1989.
8. B. Giffler and G. L. Thompson. Algorithms for solving production scheduling problems. Operations Research, 8:487-503, 1969.
9. Ari Juels and Martin Wattenberg. Stochastic hillclimbing as a baseline method for evaluating genetic algorithms. Technical Report csd-94-834, University of California, 1994.
10. Alain Hertz and Marino Widmer. La mgthode TABOU appliquge aux probltmes d'ordonnancement. Automatique, Productique, Informatique Industrielle, 29(4- 5), pages 353-378, 1995.
11. Shigenobu Kobayashi, Isao Ono, and Masayuki Yamamura. An efficient genetic algorithm for job shop scheduling problems. In Larry J. Eshelman, editor. Proc. of the Sixth International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 1995. Morgan Kaufmann, San Mateo, CA, USA, pages 506-511.
12. Ryohei Nakano and Takeshi Yamada. Conventional genetic algorithm for job shop problems. In Richard K. Belew and Lashon B. Booker, editors. Proc. of the Fourth International Conference on Genetic Algorithms, La 3olla, CA, USA, July 1991. Morgan Kaufmarm, San Mateo, CA, USA, pages 474-479.
13. Ryohei Nakano and Takeshi Yamada. A genetic algorithm applicable to largescale job-shop problems. In R. Männer and B. Manderick, editors. Proc. of the Second Conf. on Parallel Problem Solving in Nature. Elsevier Science Publishers, Amsterdam, 1992, pages 281-290.
14. Christos Papadimitriou and Kenneth Steiglitz. On the complexity of local search for the traveling salesman problem. SIAM Journal Computing, 6(1):76-83, 1977.
15. Bernard Penz. Constructions agrdgatives d'ordonnancements pour des job-shops statiques, dynamiques et rdactifs. PhD dissertation, Université de Grenoble I, 1994.
16. Ph. Preux and E-G. Talbi. Assessing the evolutionary algorithm paradigm to solve hard problems. In Constraint Processing, workshop on really hard problem solving, September 1995. An extended version is available as report LIL-95-4 from the Laboratoire d'Informatique du Littoral (ftp://ftp-lil/pub/preux/papers/lil-95-4.ps.gz)
17. C. Soares. Evolutionary computation for the job-shop scheduling problem. Technical Report UU-CS-1994-52, Utrecht University, The Netherlands, December 1994.
18. E. G. Talbi. Allocation de processus sur les architectures parallèles fi mgmoire distribude. PhD thesis, Institut National Polytechnique de Grenoble, Mai 1993.