High-performance local search for task scheduling with human resource allocation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5752 LNCS, Issue , 2009, Pages 1-15

  Estellon, Bertrand ^a   Gardi, Frédéric ^b   Nouioua, Karim ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

^b Bouygues Telecom   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORICS; DISCRETE OPTIMIZATION PROBLEMS; HUMAN RESOURCE ALLOCATION; INTERNATIONAL COMPETITIONS; LOCAL SEARCH; NP-HARD; REAL-LIFE PROBLEMS; SEARCH HEURISTICS; SUB-PROBLEMS; TASK-SCHEDULING;

COMBINATORIAL OPTIMIZATION; COMPETITION; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTERNATIONAL TRADE; LEARNING ALGORITHMS; MULTITASKING; PERSONNEL; PLANNING; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS; TELLURIUM COMPOUNDS;

PROBLEM SOLVING;

EID: 70350491185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03751-1_1     Document Type: Conference Paper

References (27)

1. ROADEF Challenge (2007): http://www.g-scop.fr/ChallengeROADEF2007/
2. Jansen, K., Woeginger, G., Yu, Z.: UET-scheduling with chain-type precedence constraints. Computers and Operations Research 22(9), 915-920 (1995)
3. Garey, M., Johnson, D.: Computer and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
4. Hurkens, C.: Incorporating the strength of MIP modeling in schedule construction. In: ROADEF 2007, le 8ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Grenoble, France (2007) (in French)
5. Ahuja, R., Ergun, Ö., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75-102 (2002)
6. Cordeau, J.F., Laporte, G., Pasin, F., Ropke, S.: ROADEF 2007 challenge: scheduling of technicians and interventions in a telecommunications company. In: ROADEF 2007, le 8ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Grenoble, France (2007) (in French)
7. ROADEF Challenge 2005: http://www.prism.uvsq.fr/̃vdc/ROADEF/ CHALLENGES/2005/
8. Estellon, B., Gardi, F., Nouioua, K.: A survey of very large-scale neighborhood search techniques. RAIRO Operations Research 40(4), 355-379 (2006)
9. Estellon, B., Gardi, F., Nouioua, K.: Two local search approaches for solving reallife car sequencing problems. European Journal of Operational Research 191(3), 928-944 (2008)
10. Benoist, T., Estellon, B., Gardi, F., Jeanjean, A.: High-performance local search for solving inventory routing problems. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 105-109. Springer, Heidelberg (2009)
11. Moret, B.: Towards a discipline of experimental algorithmics. In: Goldwasser, M., Johnson, D., McGeoch, C. (eds.) Data Structures, Near Neighbor Searches, and Methodology: 5th and 6th DIMACS Implementation Challenges. DIMACS Monographs, vol. 59, pp. 197-213. American Mathematical Society, Providence (2002)
12. Moret, B., Bader, D., Warnow, T.: High-performance algorithm engineering for computational phylogenetics. Journal of Supercomputing 22(1), 99-111 (2002)
13. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Datalogiske Skrifter (Writings on Computer Science) 81, Roskilde University, Denmark (1998)
14. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126(1), 106-130 (2000)
15. Helsgaun, K.: An effective implementation of k-opt moves for the Lin-Kernighan tsp heuristic. Datalogiske Skrifter (Writings on Computer Science) 109, Roskilde University, Denmark (2006)
16. Aarts, E., Lenstra, J. (eds.): Local Search in Combinatorial Optimization. Wiley- Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Chichester (1997)
17. Hansen, P., Mladenović, N., Pérez, J.M.: Variable neighborhood search: methods and applications. 4OR 6(4), 319-360 (2008)
18. Løkketangen, A.: The importance of being careful. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 1-15. Springer, Heidelberg (2007)
19. Pellegrini, P., Birattari, M.: Implementation effort and performance. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol. 4638, pp. 31-45. Springer, Heidelberg (2007)
20. Minoux, M.: Programmation Mathématique: Théorie et Algorithmes. Editions Tec & Doc, Lavoisier, 2nd edn. (2008) (in French)
21. Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57. Kluwer Academic Publishers, Dordrecht (2002)
22. Katriel, I., Michel, L., Hentenryck, P.V.: Maintaining longest paths incrementally. Constraints 10(2), 159-183 (2005)
23. Michel, L., Hentenryck, P.V.: A constraint-based architecture for local search. In: Proceedings of OOPSLA 2002, the 2002 ACM SIGPLAN Conference on Object- Oriented Programming Systems, Languages and Applications. SIGPLAN Notices, vol. 37, pp. 83-100. ACM Press, New York (2002)
24. Zhang, L., Malik, S.: Cache performance of SAT solvers: a case study for efficient implementation of algorithms. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 287-298. Springer, Heidelberg (2004)
25. Rosenblum, D.: Towards a method of programming with assertions. In: Proceedings of ICSE 1992, the 14th International Conference on Software Engineering, pp. 92- 104. ACM Press, New York (1992)
26. Press, W., Tenkolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes in C: the Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1995)
27. Fenlason, J., Stallman, R.: GNU gprof: the GNU profiler (1998), http://www.gnu.org/software/binutils/