Information Technology Reference
In-Depth Information
33. Reeves, C.: A Genetic Algorithm for Flowshop Sequencing. Comput. Oper. Res. 22, 5-13
(1995)
34. Reeves, C., Yamada, T.: Genetic Algorithms, path relinking and flowshop sequencing prob-
lem. Evol. Comput. 6, 45-60 (1998)
35. Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555-565 (1976)
36. Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17,
443-455 (1991)
37. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278-285
(1993)
38. Tasgetiren, M., Liang, Y.-C., Sevkli, M., Gencyilmaz, G.: Differential Evolution Algorithm
for Permutative Flowshops Sequencing Problem with Makespan Criterion. In: 4th Inter-
national Symposium on Intelligent Manufacturing Systems, IMS 2004, Sakaraya, Turkey,
September 5-8, pp. 442-452 (2004)
39. Widmer, M., Hertz, A.: A new heuristic method for the flow shop sequencing problem. Eur.
J. Oper. Res. 41, 186-193 (1989)
Search WWH ::
Custom Search