{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:42:21Z","timestamp":1725597741474},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642217043"},{"type":"electronic","value":"9783642217050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21705-0_3","type":"book-chapter","created":{"date-parts":[[2011,7,26]],"date-time":"2011-07-26T01:46:02Z","timestamp":1311644762000},"page":"55-83","source":"Crossref","is-referenced-by-count":0,"title":["Optimization Strategies for Restricted Candidate Lists in Field Service Scheduling"],"prefix":"10.1007","author":[{"given":"Marko","family":"\u017derdin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Gibrekhterman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Zahavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dovi","family":"Yellin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<240::AID-RSA2>3.0.CO;2-V","volume":"16","author":"S. Albers","year":"2000","unstructured":"Albers, S., Mitzenmacher, M.: Average-case analyses of first fit and random fit bin packing. Random Struct. Algorithms\u00a016(3), 240\u2013259 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Transformation","author":"J. Christopher Beck","year":"2002","unstructured":"Christopher Beck, J., Prosser, P., Selensky, E.: Graph transformations for the vehicle routing and job shop scheduling problems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, Springer, Heidelberg (2002)"},{"key":"3_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-45622-8_21","volume-title":"Abstraction, Reformulation, and Approximation","author":"J.C. Beck","year":"2002","unstructured":"Beck, J.C., Prosser, P., Selensky, E.: On the Reformulation of Vehicle Routing Problems and Scheduling Problems. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol.\u00a02371, pp. 282\u2013289. Springer, Heidelberg (2002)"},{"issue":"5","key":"3_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10951-006-8596-4","volume":"9","author":"J. Christopher Beck","year":"2006","unstructured":"Christopher Beck, J., Prosser, P., Selensky, E.: A case study of mutual routing-scheduling reformulation. J. Scheduling\u00a09(5), 469\u2013491 (2006)","journal-title":"J. Scheduling"},{"key":"3_CR5","unstructured":"Beck, J.C., Prosser, P., Selensky, E.: Vehicle routing and job shop scheduling: What\u2019s the difference? In: ICAPS, pp. 267\u2013276 (2003)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-85152-3_9","volume-title":"Bio-inspired Algorithms for the Vehicle Routing Problem","author":"I. Beniaminy","year":"2009","unstructured":"Beniaminy, I., Yellin, D., Zahavi, U., Zerdin, M.: When the rubber meets the road: Bio-inspired field service scheduling in the real world. In: Pereira, F.B., Tavares, J. (eds.) Bio-inspired Algorithms for the Vehicle Routing Problem, pp. 191\u2013213. Springer, Heidelberg (2009)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bertsimas, D., Gamarnik, D.: Asymptotically optimal algorithms for job shop scheduling and packet routing. Journal of Algorithms, 296\u2013318 (1999)","DOI":"10.1006\/jagm.1999.1047"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10100-008-0062-2","volume":"16","author":"I. Borgulya","year":"2008","unstructured":"Borgulya, I.: An algorithm for the capacitated vehicle routing problem with route balancing. Central European Journal of Operations Research\u00a016(4), 331\u2013343 (2008)","journal-title":"Central European Journal of Operations Research"},{"key":"3_CR9","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, pp. 213\u2013222 (2000)"},{"key":"3_CR10","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization (Bradford Books)","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization (Bradford Books). The MIT Press, Cambridge (2004)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks\u00a011(2), 109\u2013124 (1981)","journal-title":"Networks"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA 2006: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 611\u2013620 (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"3_CR15","unstructured":"Gambardella, L.C., Taillard, E., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Technical report, IDSIA, Lugano, Switzerland (1999)"},{"key":"3_CR16","unstructured":"Garey, M.R., Graham, R.L., Ullman, J.D.: An analysis of some packing algorithms. Combinatorial Algorithms, 39\u201347 (1973)"},{"key":"3_CR17","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"3_CR18","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John Wiley & Sons, Inc., New York (1975)"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z. Nutov","year":"2006","unstructured":"Nutov, Z., Beniaminy, I., Yuster, R.: A (1-1\/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett.\u00a034(3), 283\u2013288 (2006)","journal-title":"Oper. Res. Lett."},{"key":"3_CR20","unstructured":"Resende, M.G.C.: Metaheuristic hybridization with GRASP. In: Chen, Z.-L., Raghavan, S. (eds.) Tutorials in Operations Research. Inst. for Mgmt Sci. and O.R. INFORMS (2008)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1064546.1180621","volume":"10","author":"H.G. Santos","year":"2005","unstructured":"Santos, H.G., Ochi, L.S., Souza, M.J.F.: A tabu search heuristic with efficient diversification strategies for the class\/teacher timetabling problem. J. Exp. Algorithmics\u00a010, 2\u20139 (2005)","journal-title":"J. Exp. Algorithmics"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F. Spieksma","year":"1999","unstructured":"Spieksma, F.: On the approximabilty of an interval scheduling problem. Journal of Scheduling\u00a02, 215\u2013227 (1999)","journal-title":"Journal of Scheduling"},{"key":"3_CR23","first-page":"20","volume":"12","author":"R. Stein","year":"1994","unstructured":"Stein, R., Dhar, V.: Satisfying customers: Intelligently scheduling high volume service requests. AI Expert\u00a012, 20\u201327 (1994)","journal-title":"AI Expert"},{"key":"3_CR24","volume-title":"Metaheuristics: From Design to Implementation","author":"T. El-Ghazali","year":"2009","unstructured":"El-Ghazali, T.: Metaheuristics: From Design to Implementation. Wiley Publishing, Chichester (2009)"},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"K.C. Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Zhu, K.Q., Ou, K.: Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering\u00a015 (3), 281\u2013295 (2001)","journal-title":"Artificial Intelligence in Engineering"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718515"},{"key":"3_CR27","unstructured":"Vigoroso, M.W.: Field service optimization part 2: Synchronizing supply and demand in right time. Aberdeen Group Benchmark Report (2005)"},{"key":"3_CR28","unstructured":"Wagstaff, K., Basu, S., Davidson, I.: When is constrained clustering beneficial, and why? In: AAAI (2006)"},{"key":"3_CR29","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"},{"issue":"1","key":"3_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/inte.29.1.112","volume":"29","author":"D. Weigel","year":"1999","unstructured":"Weigel, D., Cao, B.: Applying GIS and OR techniques to solve sears technician-dispatching and home delivery problems. Interfaces\u00a029 (1), 113\u2013130 (1999)","journal-title":"Interfaces"}],"container-title":["Studies in Computational Intelligence","Intelligent Computational Optimization in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21705-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:17Z","timestamp":1606187057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21705-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642217043","9783642217050"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21705-0_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2011]]}}}