A tabu search approach for proportionate multiprocessor open shop scheduling
暂无分享,去创建一个
[1] D. Y. Sha,et al. A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..
[2] S. F. Fatemi Ghomi,et al. A study on open shop scheduling to minimise total tardiness , 2011 .
[3] Ching-Fang Liaw,et al. A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..
[4] Ching-Fang Liaw,et al. A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..
[5] Tamer F. Abdelmaguid. Permutation-induced acyclic networks for the job shop scheduling problem , 2009 .
[6] Salah E. Elmaghraby,et al. Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop , 2010, Eur. J. Oper. Res..
[7] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[8] Gerhard J. Woeginger,et al. Makespan minimization in open shops: A polynomial time approximation scheme , 1998, Math. Program..
[9] E. Nowicki,et al. A block approach for single-machine scheduling with release dates and due dates , 1986 .
[10] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[11] Salah E. Elmaghraby,et al. An empirical and theoretical study of outpatient scheduling problems employing simulation and genetic algorithm methodologies , 2004 .
[12] Gerhard J. Woeginger,et al. Linear time approximation scheme for the multiprocessor open shop problem , 2001, Discret. Appl. Math..
[13] Teofilo F. Gonzalez,et al. Open Shop Scheduling to Minimize Finish Time , 1976, JACM.
[14] Christian Blum,et al. Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..
[15] Mostafa Zandieh,et al. Scheduling open shops with parallel machines to minimize total completion time , 2011, J. Comput. Appl. Math..
[16] Christian Prins,et al. Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..
[17] Daniele Vigo,et al. A tabu search algorithm for the Open Shop problem , 1997 .
[18] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[19] David B. Shmoys,et al. Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.
[20] Peter Ross,et al. A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems , 1994, ECAI.
[21] Marie E. Matta. A genetic algorithm for the proportionate multiprocessor open shop , 2009, Comput. Oper. Res..
[22] Vitaly A. Strusevich,et al. Approximation Algorithms for Three-Machine Open Shop Scheduling , 1993, INFORMS J. Comput..
[23] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[24] Gerhard J. Woeginger,et al. Approximation algorithms for the multiprocessor open shop scheduling problem , 1999, Oper. Res. Lett..
[25] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[26] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[27] Ching-Fang Liaw,et al. Applying simulated annealing to the open shop scheduling problem , 1999 .