A new hybrid parallel genetic algorithm for the job-shop scheduling problem
暂无分享,去创建一个
[1] Isao Ono,et al. A genetic algorithm for job-shop scheduling problems using job-based order crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[2] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[3] D. Y. Sha,et al. A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..
[4] Eugeniusz Nowicki,et al. Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..
[5] Erik D. Goodman,et al. Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems , 1997, Evolutionary Programming.
[6] L. Darrell Whitley,et al. Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..
[7] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[8] Erwin Pesch,et al. Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..
[9] S. S. Panwalkar,et al. A Survey of Scheduling Rules , 1977, Oper. Res..
[10] Helena R. Lourenço,et al. A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling , 2007, EvoCOP.
[11] Panos M. Pardalos,et al. Solving job shop scheduling problems utilizing the properties of backbone and “big valley” , 2010, Comput. Optim. Appl..
[12] Christian Blum,et al. An Ant Colony Optimization Algorithm for Shop Scheduling Problems , 2004, J. Math. Model. Algorithms.
[13] R. Storer,et al. New search spaces for sequencing problems with application to job shop scheduling , 1992 .
[14] Peigen Li,et al. A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..
[15] Panos M. Pardalos,et al. An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques , 2006, Comput. Manag. Sci..
[16] Vassilios S. Vassiliadis,et al. A novel threshold accepting meta-heuristic for the job-shop scheduling problem , 2004, Comput. Oper. Res..
[17] Christian Bierwirth,et al. Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.
[18] Mehmet Emin Aydin,et al. A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems , 2004, J. Heuristics.
[19] Egon Balas,et al. Discrete Programming by the Filter Method , 1967, Oper. Res..
[20] Ching-Jong Liao,et al. Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..
[21] Christos D. Tarantilis,et al. A hybrid evolutionary algorithm for the job shop scheduling problem , 2009, J. Oper. Res. Soc..
[22] Akiko Takeda,et al. A relaxation algorithm with a probabilistic guarantee for robust deviation optimization , 2010, Comput. Optim. Appl..
[23] Michael Kolonko. Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..
[24] Ioannis T. Christou,et al. Optimal and Asymptotically Optimal Equi-partition of Rectangular Domains via Stripe Decomposition , 1996 .
[25] Christian Bierwirth,et al. A search space analysis of the Job Shop Scheduling Problem , 1999, Ann. Oper. Res..
[26] Ali M. S. Zalzala,et al. Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..
[27] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[28] Éric D. Taillard,et al. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..
[29] Mehmet Emin Aydin,et al. A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems , 2006, EvoCOP.
[30] Renata M. Aiex,et al. Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..
[31] J. K. Lenstra,et al. Computational complexity of discrete optimization problems , 1977 .
[32] Paolo Gaiardelli,et al. Hybrid genetic algorithmsfor a multiple-objective scheduling problem , 1998, J. Intell. Manuf..
[33] Eugeniusz Nowicki,et al. An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..
[34] Stephen F. Smith,et al. How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines , 2006, J. Artif. Intell. Res..
[35] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[36] Weijun Xia,et al. A hybrid particle swarm optimization approach for the job-shop scheduling problem , 2006 .
[37] Reha Uzsoy,et al. A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.
[38] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[39] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[40] C. D. Tarantilis,et al. A list-based threshold accepting method for job shop scheduling problems , 2002 .