Local search algorithms for the multiprocessor flow shop scheduling problem
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[3] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[4] Stéphane Dauzère-Pérès,et al. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..
[5] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[7] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..
[8] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[9] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[10] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[11] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[12] Jan Karel Lenstra,et al. PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .
[13] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[14] Johann L. Hurink,et al. Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .