Metaheuristics and Scheduling

[1]  Heiner Müller-Merbach,et al.  Heuristics and their design: a survey , 1981 .

[2]  Toshihide Ibaraki,et al.  Metaheuristics : progress as real problem solvers , 2005 .

[3]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[4]  Manuel Laguna,et al.  Tabu Search , 1997 .

[5]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[6]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[7]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[8]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[9]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[10]  M. Widmer,et al.  Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach , 1991 .

[11]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[14]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[15]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Ehl Emile Aarts,et al.  Simulated annealing and Boltzmann machines , 2003 .

[17]  Ulrich Faigle,et al.  Some Convergence Results for Probabilistic Tabu Search , 1992, INFORMS J. Comput..

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  Pablo Moscato,et al.  An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search , 1993, Ann. Oper. Res..

[20]  Marius Sinclair,et al.  Comparison of the performance of modern heuristics for combinatorial optimization on real data , 1993, Comput. Oper. Res..

[21]  Nicos Christofides,et al.  Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .

[22]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[23]  D. de Werra,et al.  A tutorial on heuristic methods , 1980 .

[24]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[25]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[26]  Alain Hertz,et al.  A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization , 1999, J. Heuristics.

[27]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[28]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[29]  Chris N. Potts,et al.  A comparison of local search methods for flow shop scheduling , 1996, Ann. Oper. Res..

[30]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[31]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[32]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[33]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[34]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[35]  Wojciech Bozejko,et al.  A Neuro-tabu Search Algorithm for the Job Shop Problem , 2010, ICAISC.

[36]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[37]  Daniel Costa,et al.  An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem , 1995 .

[38]  Gerd Finke,et al.  Scheduling with resource management in manufacturing systems , 1994 .

[39]  G. Dueck.  New optimization heuristics , 1993 .

[40]  D. Werra,et al.  Tabu search: a tutorial and an application to neural networks , 1989 .

[41]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[42]  Alain Hertz,et al.  Guidelines for the use of meta-heuristics in combinatorial optimization , 2003, Eur. J. Oper. Res..

[43]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[44]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

[46]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[47]  N. E. Collins,et al.  Simulated annealing - an annotated bibliography , 1988 .

[48]  Alain Hertz,et al.  An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques , 1996, Oper. Res..

[49]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[50]  Patrick D. Surry,et al.  Formal Memetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.

[51]  Fred W. Glover,et al.  A scatter search approach for unconstrained continuous optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[52]  Marco Dorigo,et al.  An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.

[53]  James P. Kelly,et al.  A scatter-search-based learning algorithm for neural network training , 1996, J. Heuristics.

[54]  Alain Hertz,et al.  An Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints , 1996, Discret. Appl. Math..

[55]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[56]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[57]  Colin Reeves,et al.  Hybrid genetic algorithms for bin-packing and related problems , 1996, Ann. Oper. Res..

[58]  Bruce E. Hajek,et al.  Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..

[59]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[60]  Ian C. Parmee,et al.  Optimization in industry , 2002 .

[61]  F. Glover.  Scatter search and star-paths: beyond the genetic metaphor , 1995 .

[62]  James R. Evans,et al.  Heuristic methods and applications: A categorized survey , 1989 .

[63]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[64]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[65]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .