Parallel Meta2heuristics for the Flexible Job Shop Problem
暂无分享,去创建一个
Wojciech Bozejko | Mieczyslaw Wodecki | Mariusz Uchronski | W. Bożejko | M. Wodecki | Mariusz Uchroński
[1] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[2] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[3] Mitsuo Gen,et al. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..
[4] F. Pezzella,et al. A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..
[5] Luca Maria Gambardella,et al. Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .
[6] 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..
[7] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..