J. B. Atkinson, A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy, Journal of the Operational Research Society, vol.49, issue.7, pp.700-708, 1998.
DOI : 10.1057/palgrave.jors.2600521

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2001.

P. Dutot and A. Laugier, Technicians and interventions scheduling for telecommunications(ROADEF challenge subject), 2005.

T. A. Feo and M. G. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters, vol.8, issue.2, pp.67-71, 1989.
DOI : 10.1016/0167-6377(89)90002-3

P. Festa and M. G. Resende, Grasp: An Annotated Bibliography, Essays and surveys in metaheuristics, pp.325-367, 2002.
DOI : 10.1007/978-1-4615-1507-4_15

C. Fleurent and F. Glover, Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory, INFORMS Journal on Computing, vol.11, issue.2, pp.198-204, 1999.
DOI : 10.1287/ijoc.11.2.198

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, 2004.
DOI : 10.1007/978-3-540-24777-7

A. Lodi, S. Martello, and D. Vigo, Models and Bounds for Two-Dimensional Level Packing Problems, Journal of Combinatorial Optimization, vol.8, issue.3, pp.363-379, 2004.
DOI : 10.1023/B:JOCO.0000038915.62826.79

M. G. Resende and C. C. Ribeiro, A GRASP for graph planarization. Networks, pp.173-189, 1997.

M. G. Resende and C. C. Ribeiro, Greedy randomized adaptive search procedures Adaptive memory programming: A unified view of metaheuristics, Handbook of Metaheuristics, pp.219-2491, 2001.

J. Xu and S. Y. Chiu, Effective heuristic procedures for a field technician scheduling problem, Journal of Heuristics, vol.7, issue.5, pp.495-509, 2001.
DOI : 10.1023/A:1011377929184