Abstract
In this paper, a real-life problem of task scheduling with human resource allocation is addressed. This problem was approached by the authors in the context of the ROADEF 2007 Challenge, which is an international competition organized by the French Operations Research Society. The subject of the contest, proposed by the telecommunications company France Télé com, consists in planning maintenance interventions and teams of technicians needed for their achievements. The addressed combinatorial optimization problem is very hard: it contains several NP-hard subproblems and its scale (hundreds of interventions and technicians) induces a huge combinatorics. An effective and efficient local-search heuristic is described to solve this problem. This algorithm was ranked 2nd of the competition (over the 35 teams who have submitted a solution). Moreover, a methodology is revealed to design and engineer high-performance local-search heuristics for solving practically discrete optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ROADEF Challenge (2007): http://www.g-scop.fr/ChallengeROADEF2007/
Jansen, K., Woeginger, G., Yu, Z.: UET-scheduling with chain-type precedence constraints. Computers and Operations Research 22(9), 915–920 (1995)
Garey, M., Johnson, D.: Computer and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman & Co., New York (1979)
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)
Ahuja, R., Ergun, Ö., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)
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)
ROADEF Challenge 2005: http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/2005/
Estellon, B., Gardi, F., Nouioua, K.: A survey of very large-scale neighborhood search techniques. RAIRO Operations Research 40(4), 355–379 (2006)
Estellon, B., Gardi, F., Nouioua, K.: Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research 191(3), 928–944 (2008)
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, the 2nd International Workshop on Engineering Stochastic Local Search Algorithms. LNCS, vol. 5752, pp. 105–109. Springer, Heidelberg (2009)
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)
Moret, B., Bader, D., Warnow, T.: High-performance algorithm engineering for computational phylogenetics. Journal of Supercomputing 22(1), 99–111 (2002)
Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Datalogiske Skrifter (Writings on Computer Science) 81, Roskilde University, Denmark (1998)
Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research 126(1), 106–130 (2000)
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)
Aarts, E., Lenstra, J. (eds.): Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Chichester (1997)
Hansen, P., Mladenović, N., Pérez, J.M.: Variable neighborhood search: methods and applications. 4OR 6(4), 319–360 (2008)
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)
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)
Minoux, M.: Programmation Mathématique: Théorie et Algorithmes. Éditions Tec & Doc, Lavoisier, 2nd edn. (2008) (in French)
Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57. Kluwer Academic Publishers, Dordrecht (2002)
Katriel, I., Michel, L., Hentenryck, P.V.: Maintaining longest paths incrementally. Constraints 10(2), 159–183 (2005)
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)
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)
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)
Press, W., Tenkolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes in C: the Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1995)
Fenlason, J., Stallman, R.: GNU gprof: the GNU profiler (1998), http://www.gnu.org/software/binutils/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Estellon, B., Gardi, F., Nouioua, K. (2009). High-Performance Local Search for Task Scheduling with Human Resource Allocation. In: Stützle, T., Birattari, M., Hoos, H.H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2009. Lecture Notes in Computer Science, vol 5752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03751-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03751-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03750-4
Online ISBN: 978-3-642-03751-1
eBook Packages: Computer ScienceComputer Science (R0)