{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:21:49Z","timestamp":1753888909450},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030295158"},{"type":"electronic","value":"9783030295165"}],"license":[{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-29516-5_86","type":"book-chapter","created":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T12:03:48Z","timestamp":1566561828000},"page":"1168-1177","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving the Service Technician Routing and Scheduling Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Amy","family":"Khalfay","sequence":"first","affiliation":[]},{"given":"Alan","family":"Crispin","sequence":"additional","affiliation":[]},{"given":"Keeley","family":"Crockett","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"issue":"3","key":"86_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10951-011-0245-x","volume":"15","author":"M F\u0131rat","year":"2012","unstructured":"F\u0131rat, M., Hurkens, C.A.J.: An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Sched. 15(3), 363\u2013380 (2012)","journal-title":"J. Sched."},{"issue":"7","key":"86_CR2","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1007\/s11590-012-0567-4","volume":"7","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gueret, C., Medaglia, A.L.: A parallel matheuristic for the technician routing and scheduling problem. Optim. Lett. 7(7), 1525\u20131535 (2013)","journal-title":"Optim. Lett."},{"issue":"3","key":"86_CR3","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Bergh Van den","year":"2013","unstructured":"Van den Bergh, J., Beli\u00ebn, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367\u2013385 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"86_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10100-013-0305-8","volume":"23","author":"G Hiermann","year":"2015","unstructured":"Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., Raidl, G.R.: Metaheuristics for solving a multimodal home-healthcare scheduling problem. Cent. Eur. J. Oper. Res. 23(1), 89\u2013113 (2015)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"86_CR5","doi-asserted-by":"crossref","unstructured":"Paraskevopoulos, D.C., Laporte, G., Repoussis, P.P., Tarantilis, C.D.: Resource constrained routing and scheduling: review and research prospects (2016)","DOI":"10.1016\/j.ejor.2017.05.035"},{"issue":"5","key":"86_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579\u2013600 (2012)","journal-title":"J. Sched."},{"issue":"2","key":"86_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"86_CR8","unstructured":"French Operational\u00a0Research Society: What is the ROADEF 2007 challenge (2016). \n                  http:\/\/challenge.roadef.org\/2007\/en\/"},{"key":"86_CR9","doi-asserted-by":"crossref","unstructured":"Pillac, V., Gu\u00e9ret, C., Medaglia, A.: On the dynamic technician routing and scheduling problem (2012)","DOI":"10.1007\/s11590-012-0567-4"},{"issue":"2","key":"86_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10100-011-0231-6","volume":"21","author":"F Tricoire","year":"2013","unstructured":"Tricoire, F., Bostel, N., Dejax, P., Guez, P.: Exact and hybrid methods for the multiperiod field service routing problem. Cent. Eur. J. Oper. Res. 21(2), 359\u2013377 (2013)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"86_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.omega.2015.07.006","volume":"61","author":"X Chen","year":"2016","unstructured":"Chen, X., Thomas, B.W., Hewitt, M.: The technician routing problem with experience-based service times. Omega 61, 49\u201361 (2016)","journal-title":"Omega"},{"key":"86_CR12","doi-asserted-by":"crossref","unstructured":"Mathlouthi, I., Gendreau, M., Potvin, J.-Y.: Mixed integer programming for a multi-attribute technician routing and scheduling problem (2016)","DOI":"10.1080\/03155986.2017.1335047"},{"key":"86_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ejor.2016.06.058","volume":"257","author":"E Zamorano","year":"2016","unstructured":"Zamorano, E., Stolletz, R.: Branch-and-price approaches for the multiperiod technician routing and scheduling problem. Eur. J. Oper. Res. 257, 55\u201368 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"86_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-010-0188-7","volume":"13","author":"J-F Cordeau","year":"2010","unstructured":"Cordeau, J.-F., Laporte, G., Pasin, F., Ropke, S.: Scheduling technicians and tasks in a telecommunications company. J. Sched. 13(4), 393\u2013409 (2010)","journal-title":"J. Sched."},{"key":"86_CR15","unstructured":"Kundu, S., Mahato, M., Mahanty, B., Acharyya, S.: Comparative performance of simulated annealing and genetic algorithm in solving nurse scheduling problem. In: Proceedings of the International MultiConference of Engineers and Computer Scientists vol. 1, pp. 96\u2013100 (2008)"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29516-5_86","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T12:28:17Z","timestamp":1566563297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29516-5_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,24]]},"ISBN":["9783030295158","9783030295165"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29516-5_86","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,8,24]]},"assertion":[{"value":"24 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IntelliSys","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Proceedings of SAI Intelligent Systems Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intellisys2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/saiconference.com\/IntelliSys","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}