Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..
[2] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[3] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..
[4] L. D. Whitley,et al. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem , 2003 .
[5] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[6] Peter Salamon,et al. Facts, Conjectures, and Improvements for Simulated Annealing , 1987 .
[7] Egon Balas,et al. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .
[8] Jean-Paul Watson,et al. Linking Search Space Structure, Run-Time Dynamics, and Problem Difficulty: A Step Toward Demystifying Tabu Search , 2005, ArXiv.
[9] Christian Bierwirth,et al. A search space analysis of the Job Shop Scheduling Problem , 1999, Ann. Oper. Res..
[10] Helena Ramalhinho Dias Lourenço,et al. Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .
[11] Peter Greistorfer,et al. Experimental pool design: input, output and combination strategies for scatter search , 2004 .
[12] Dirk C. Mattfeld,et al. Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.
[13] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[14] Jacek Blazewicz,et al. The job shop scheduling problem: Conventional and new solution techniques , 1996 .
[15] Emanuela Merelli,et al. A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..
[16] Sheik Meeran,et al. Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..
[17] Alan F. Murray,et al. IEEE International Conference on Neural Networks , 1997 .
[18] Fred Glover,et al. Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.
[19] Mauro Dell'Amico,et al. Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..
[20] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[21] Ramesh Sharda,et al. Metaheuristic Optimization via Memory and Evolution , 2005 .
[22] Jan Karel Lenstra,et al. A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..
[23] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[24] Richard Bellman,et al. The Job-shop Scheduling Problem , 1982 .
[25] David S. Johnson,et al. A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.
[26] Michael H. Goldwasser,et al. Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999 , 2002, Data Structures, Near Neighbor Searches, and Methodology.
[27] F. Glover,et al. Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.
[28] L. Darrell Whitley,et al. Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..
[29] Emile H. L. Aarts,et al. A new polynomial time cooling schedule , 1985 .
[30] Takeshi Yamada,et al. Critical Block Simulated Annealing for Job Shop Scheduling , 1994 .
[31] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[32] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[33] Éric D. Taillard,et al. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..
[34] T. Yamada,et al. Job shop scheduling , 1997 .
[35] Pierre Hansen,et al. Algorithms for the maximum satisfiability problem , 1987, Computing.
[36] J. Barnes,et al. Solving the job shop scheduling problem with tabu search , 1995 .
[37] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[38] Eugeniusz Nowicki,et al. Some New Ideas in TS for Job Shop Scheduling , 2005 .
[39] David B. Shmoys,et al. A computational study of the job-shop and the flow-shop scheduling problems , 1993 .
[40] Ashish Jain,et al. A Multi-Level Hybrid Framework for the Deterministic Job-Shop Scheduling Problem , 1998 .
[41] F. Glover. Scatter search and path relinking , 1999 .
[42] Frank Werner,et al. Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..