论文信息 - Równoległy algorytm scatter search dla problemu przepływowego z kryterium Csum - 字舞流文

Równoległy algorytm scatter search dla problemu przepływowego z kryterium Csum

Wojciech Bożejko | Mieczysław Wodecki

[1] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

[2] Jean-Marie Proth,et al. Heuristic approaches for n/m/F/ ∑Ci scheduling problems , 1997 .

[3] M. Wodecki,et al. Parallet algorithm for some single machine scheduling problems , 2002 .

[4] Wojciech Bozejko,et al. Solving the flow shop problem by parallel tabu search , 2002, Proceedings. International Conference on Parallel Computing in Electrical Engineering.

[5] F. Glover,et al. Sequential and parallel path-relinking algorithms for the quadratic assignment problem , 2005, IEEE Intelligent Systems.

[6] J. Grabowski,et al. New block properties for the permutation flow shop problem with application in tabu search , 2001, J. Oper. Res. Soc..

[7] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .

[8] Wojciech Bozejko,et al. Solving the Flow Shop Problem by Parallel Simulated Annealing , 2001, PPAM.