{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T18:51:17Z","timestamp":1779907877565,"version":"3.53.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T00:00:00Z","timestamp":1242777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10479-009-0545-0","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T09:24:50Z","timestamp":1242725090000},"page":"143-161","source":"Crossref","is-referenced-by-count":43,"title":["A GRASP-based approach for technicians and interventions scheduling for telecommunications"],"prefix":"10.1007","volume":"183","author":[{"given":"Hideki","family":"Hashimoto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Boussier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Vasquez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Wilbaut","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,5,20]]},"reference":[{"key":"545_CR1","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1057\/palgrave.jors.2600521","volume":"49","author":"J.\u00a0B. Atkinson","year":"1998","unstructured":"Atkinson, J.\u00a0B. (1998). A greedy randomized search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. Journal of the Operational Research Society, 49, 700\u2013708.","journal-title":"Journal of the Operational Research Society"},{"key":"545_CR2","volume-title":"Introduction to algorithms","author":"T.\u00a0H. Cormen","year":"2001","unstructured":"Cormen, T.\u00a0H., Leiserson, C.\u00a0E., Rivest, R.\u00a0L., & Stein,\u00a0C. (2001). Introduction to algorithms (2nd ed.). Cambridge: MIT.","edition":"2"},{"key":"545_CR3","unstructured":"Dutot, P.-F., & Laugier,\u00a0A. (2005). Technicians and interventions scheduling for telecommunications (ROADEF challenge subject). Technical report, France Telecom R&D."},{"key":"545_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and surveys in metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa,\u00a0P., & Resende, M.\u00a0G.\u00a0C. (2002). GRASP: An annotated bibliography. In C.\u00a0C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 325\u2013367). Dordrecht: Kluwer."},{"key":"545_CR5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent,\u00a0C., & Glover,\u00a0F. (1999). Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"545_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer,\u00a0H., Pferschy,\u00a0U., & Pisinger,\u00a0D. (2004). Knapsack problems. Berlin: Springer."},{"key":"545_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A. Lodi","year":"2004","unstructured":"Lodi,\u00a0A., Martello,\u00a0S., & Vigo,\u00a0D. (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization, 8, 363\u2013379.","journal-title":"Journal of Combinatorial Optimization"},{"key":"545_CR8","unstructured":"Pitsoulis,\u00a0L., & Resende,\u00a0M. (2001). Greedy randomized adaptive search procedures. Technical report, AT&T Labs Research."},{"key":"545_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"M.\u00a0G.\u00a0C. Resende","year":"1997","unstructured":"Resende, M.\u00a0G.\u00a0C., & Ribeiro, C.\u00a0C. (1997). A GRASP for graph planarization. Networks, 29, 173\u2013189.","journal-title":"Networks"},{"key":"545_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of metaheuristics","author":"M.\u00a0G.\u00a0C. Resende","year":"2003","unstructured":"Resende, M.\u00a0G.\u00a0C., & Ribeiro, C.\u00a0C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G.\u00a0A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219\u2013249). Dordrecht: Kluwer."},{"key":"545_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"\u00c9.\u00a0D. Taillard","year":"2001","unstructured":"Taillard, \u00c9.\u00a0D., Gambardella, L.\u00a0M., Gendreau,\u00a0M., & Potvin, J.-Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135, 1\u201316.","journal-title":"European Journal of Operational Research"},{"key":"545_CR12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1011377929184","volume":"7","author":"J. Xu","year":"2001","unstructured":"Xu,\u00a0J., & Chiu, S.\u00a0Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7, 495\u2013509.","journal-title":"Journal of Heuristics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0545-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-009-0545-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-009-0545-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:54Z","timestamp":1559138874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-009-0545-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,20]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["545"],"URL":"https:\/\/doi.org\/10.1007\/s10479-009-0545-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,20]]}}}