Kacem, Imed; Hammadi, Slim; Borne, Pierre - In: Mathematics and Computers in Simulation (MATCOM) 60 (2002) 3, pp. 245-276
Most scheduling problems are complex combinatorial problems and very difficult to solve [Manage. Sci. 35 (1989) 164; F.S. Hillier, G.J. Lieberman, Introduction to Operations Research, Holden-Day, San Francisco, CA, 1967]. That is why, lots of methods focus on the optimization according to a single...
