1. Beck, J. C. & Perron, L. (2000). Discrepancy-bounded depth first search. In Proc. of the second international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR’00) (pp. 8–10). Paderborn, Germany.
2. Solving two-stage hybrid flow shop using climbing depth-bounded discrepancy search;Ben Hmida;Computers and Industrial Engineering,2010
3. Climbing depth-bounded discrepancy search for solving hybrid flow shop scheduling problems;Ben Hmida;European Journal of Industrial Engineering,2007
4. A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation;Bertel;European Journal of Operational Research,2004
5. An algorithm for finding optimal or near optimal solutions to the production scheduling problem;Brooks;Journal of Industrial Engineering,1965