Metody dywersyfikacji procesu przeszukiwań algorytmów popraw dla problemu przepływowego z kryterium sumacyjnym
暂无分享，去创建一个
[1] Jean-Marie Proth,et al. Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .
[2] Kenneth Steiglitz,et al. Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.
[3] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[4] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[5] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .
[6] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..
[7] Jose M. Framiñan,et al. Approximative procedures for no-wait job shop scheduling , 2003, Oper. Res. Lett..
[8] Józef Grabowski,et al. Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..