{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:15:58Z","timestamp":1761894958074},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037504"},{"type":"electronic","value":"9783642037511"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03751-1_1","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T05:27:42Z","timestamp":1251782862000},"page":"1-15","source":"Crossref","is-referenced-by-count":16,"title":["High-Performance Local Search for Task Scheduling with Human Resource Allocation"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Estellon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Gardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Nouioua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"ROADEF Challenge (2007): \n                    \n                      http:\/\/www.g-scop.fr\/ChallengeROADEF2007\/"},{"issue":"9","key":"1_CR2","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/0305-0548(94)00084-L","volume":"22","author":"K. Jansen","year":"1995","unstructured":"Jansen, K., Woeginger, G., Yu, Z.: UET-scheduling with chain-type precedence constraints. Computers and Operations Research\u00a022(9), 915\u2013920 (1995)","journal-title":"Computers and Operations Research"},{"key":"1_CR3","volume-title":"Computer and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computer and Intractability: a Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman & Co., New York (1979)"},{"key":"1_CR4","unstructured":"Hurkens, C.: Incorporating the strength of MIP modeling in schedule construction. In: ROADEF 2007, le 8\u00e8me Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision, Grenoble, France (2007) (in French)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. Ahuja","year":"2002","unstructured":"Ahuja, R., Ergun, \u00d6., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123, 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR6","unstructured":"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\u00e8me Congr\u00e8s de la Soci\u00e9t\u00e9 Fran\u00e7aise de Recherche Op\u00e9rationnelle et d\u2019Aide \u00e0 la D\u00e9cision, Grenoble, France (2007) (in French)"},{"key":"1_CR7","unstructured":"ROADEF Challenge 2005: \n                    \n                      http:\/\/www.prism.uvsq.fr\/~vdc\/ROADEF\/CHALLENGES\/2005\/"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1051\/ro:2007003","volume":"40","author":"B. Estellon","year":"2006","unstructured":"Estellon, B., Gardi, F., Nouioua, K.: A survey of very large-scale neighborhood search techniques. RAIRO Operations Research\u00a040(4), 355\u2013379 (2006)","journal-title":"RAIRO Operations Research"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1016\/j.ejor.2007.04.043","volume":"191","author":"B. Estellon","year":"2008","unstructured":"Estellon, B., Gardi, F., Nouioua, K.: Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research\u00a0191(3), 928\u2013944 (2008)","journal-title":"European Journal of Operational Research"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-642-03751-1_8","volume-title":"SLS 2009, the 2nd International Workshop on Engineering Stochastic Local Search Algorithms","author":"T. Benoist","year":"2009","unstructured":"Benoist, T., Estellon, B., Gardi, F., Jeanjean, A.: High-performance local search for solving inventory routing problems. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009, the 2nd International Workshop on Engineering Stochastic Local Search Algorithms. LNCS, vol.\u00a05752, pp. 105\u2013109. Springer, Heidelberg (2009)"},{"key":"1_CR11","series-title":"DIMACS Monographs","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1090\/dimacs\/059\/10","volume-title":"Data Structures, Near Neighbor Searches, and Methodology: 5th and 6th DIMACS Implementation Challenges.","author":"B. Moret","year":"2002","unstructured":"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.\u00a059, pp. 197\u2013213. American Mathematical Society, Providence (2002)"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1014362705613","volume":"22","author":"B. Moret","year":"2002","unstructured":"Moret, B., Bader, D., Warnow, T.: High-performance algorithm engineering for computational phylogenetics. Journal of Supercomputing\u00a022(1), 99\u2013111 (2002)","journal-title":"Journal of Supercomputing"},{"key":"1_CR13","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Datalogiske Skrifter (Writings on Computer Science)\u00a081, Roskilde University, Denmark (1998)"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"key":"1_CR15","unstructured":"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)"},{"key":"1_CR16","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Local Search in Combinatorial Optimization","year":"1997","unstructured":"Aarts, E., Lenstra, J. (eds.): Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons, Chichester (1997)"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P. Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.M.: Variable neighborhood search: methods and applications. 4OR\u00a06(4), 319\u2013360 (2008)","journal-title":"4OR"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74446-7_1","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"A. L\u00f8kketangen","year":"2007","unstructured":"L\u00f8kketangen, A.: The importance of being careful. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol.\u00a04638, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-74446-7_3","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"P. Pellegrini","year":"2007","unstructured":"Pellegrini, P., Birattari, M.: Implementation effort and performance. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol.\u00a04638, pp. 31\u201345. Springer, Heidelberg (2007)"},{"key":"1_CR20","unstructured":"Minoux, M.: Programmation Math\u00e9matique: Th\u00e9orie et Algorithmes. \u00c9ditions Tec & Doc, Lavoisier, 2nd edn. (2008) (in French)"},{"key":"1_CR21","series-title":"International Series in Operations Research and Management Science","volume-title":"Handbook of Metaheuristics","year":"2002","unstructured":"Glover, F., Kochenberger, G. (eds.): Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol.\u00a057. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10601-005-0554-9","volume":"10","author":"I. Katriel","year":"2005","unstructured":"Katriel, I., Michel, L., Hentenryck, P.V.: Maintaining longest paths incrementally. Constraints\u00a010(2), 159\u2013183 (2005)","journal-title":"Constraints"},{"key":"1_CR23","series-title":"SIGPLAN Notices","first-page":"83","volume-title":"Proceedings of OOPSLA 2002, the 2002 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications","author":"L. Michel","year":"2002","unstructured":"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.\u00a037, pp. 83\u2013100. ACM Press, New York (2002)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24605-3_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"L. Zhang","year":"2004","unstructured":"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.\u00a02919, pp. 287\u2013298. Springer, Heidelberg (2004)"},{"key":"1_CR25","first-page":"92","volume-title":"Proceedings of ICSE 1992, the 14th International Conference on Software Engineering","author":"D. Rosenblum","year":"1992","unstructured":"Rosenblum, D.: Towards a method of programming with assertions. In: Proceedings of ICSE 1992, the 14th International Conference on Software Engineering, pp. 92\u2013104. ACM Press, New York (1992)"},{"key":"1_CR26","volume-title":"Numerical Recipes in C: the Art of Scientific Computing","author":"W. Press","year":"1995","unstructured":"Press, W., Tenkolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes in C: the Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1995)","edition":"2"},{"key":"1_CR27","unstructured":"Fenlason, J., Stallman, R.: GNU gprof: the GNU profiler (1998), \n                    \n                      http:\/\/www.gnu.org\/software\/binutils\/"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03751-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:30:46Z","timestamp":1552131046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03751-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037504","9783642037511"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03751-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}