{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T19:51:19Z","timestamp":1771530679199,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T00:00:00Z","timestamp":1477267200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"DPST Thailand","award":["472067"],"award-info":[{"award-number":["472067"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10479-016-2352-8","type":"journal-article","created":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T15:57:59Z","timestamp":1477324679000},"page":"93-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Decomposition techniques with mixed integer programming and heuristics for home healthcare planning"],"prefix":"10.1007","volume":"256","author":[{"given":"Wasakorn","family":"Laesanklang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"issue":"4","key":"2352_CR1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.cie.2007.06.002","volume":"53","author":"C Akjiratikarl","year":"2007","unstructured":"Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007). PSO-based algorithm for home care worker scheduling in the UK. Computers and Industrial Engineering, 53(4), 559\u2013583.","journal-title":"Computers and Industrial Engineering"},{"key":"2352_CR2","unstructured":"Algethami, H., & Landa-Silva, D. (2015). A study of genetic operators for the workforce scheduling and routing problem. In Proceedings of the XI metaheuristics international conference (MIC 2015) (pp 75.1\u201375.11)"},{"issue":"12","key":"2352_CR3","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.1002\/aic.690421209","volume":"42","author":"MH Bassett","year":"1996","unstructured":"Bassett, M. H., Pekny, J. F., & Reklaitis, G. V. (1996). Decomposition techniques for the solution of large-scale scheduling problems. AIChE Journal, 42(12), 3373\u20133387.","journal-title":"AIChE Journal"},{"issue":"1","key":"2352_CR4","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"2352_CR5","doi-asserted-by":"crossref","unstructured":"Borsani, V., Matta, A., Beschi, G., & Sommaruga, F. (2006). A home care scheduling model for human resources. In 2006 International conference on service systems and service management, vol. 1 (pp 449\u2013454)","DOI":"10.1109\/ICSSSM.2006.320504"},{"issue":"3","key":"2352_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157\u2013183.","journal-title":"Annals of Operations Research"},{"key":"2352_CR7","doi-asserted-by":"crossref","unstructured":"Bredstr\u00f6m, D., & R\u00f6nnqvist, M. (2007). A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. NHH Dept of Finance & Management Science Discussion Paper No 2007\/7","DOI":"10.2139\/ssrn.971726"},{"issue":"1","key":"2352_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m, D., & R\u00f6nnqvist, M. (2008). Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. European Journal of Operational Research, 191(1), 19\u201331.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2352_CR9","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.1030.0054","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A. M., & Savelsbergh, M. W. P. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488\u2013502.","journal-title":"Transportation Science"},{"key":"2352_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-014-1687-2","author":"JA Castillo-Salazar","year":"2014","unstructured":"Castillo-Salazar, J. A., Landa-Silva, D., & Qu, R. (2014). Workforce scheduling and routing problems: literature survey and computational study. Annals of Operations Research,. doi: 10.1007\/s10479-014-1687-2 .","journal-title":"Annals of Operations Research"},{"issue":"4","key":"2352_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/trsc.35.4.375.10432","volume":"35","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J. F., Stojkovi\u0107, G., Soumis, F., & Desrosiers, J. (2001). Benders decomposition for simultaneous aircraft routing and crew scheduling. Transportation Science, 35(4), 375\u2013388.","journal-title":"Transportation Science"},{"issue":"6","key":"2352_CR12","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1016\/j.cor.2005.07.004","volume":"34","author":"AI Corr\u00e9a","year":"2007","unstructured":"Corr\u00e9a, A. I., Langevin, A., & Rousseau, L. M. (2007). Scheduling and routing of automated guided vehicles: A hybrid approach. Computers and Operations Research, 34(6), 1688\u20131707. part Special Issue: Odysseus 2003 Second International Workshop on Freight Transportation Logistics.","journal-title":"Computers and Operations Research"},{"issue":"6","key":"2352_CR13","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/j.cor.2003.11.012","volume":"32","author":"AM Costa","year":"2005","unstructured":"Costa, A. M. (2005). A survey on benders decomposition applied to fixed-charge network design problems. Computers and Operations Research, 32(6), 1429\u20131450.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"2352_CR14","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","volume":"36","author":"A Dohn","year":"2009","unstructured":"Dohn, A., Kolind, E., & Clausen, J. (2009). The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Computers and Operations Research, 36(4), 1145\u20131157.","journal-title":"Computers and Operations Research"},{"key":"2352_CR15","volume-title":"Discovering Statistics Using IBM SPSS Statistics","author":"A Field","year":"2013","unstructured":"Field, A. (2013). Discovering Statistics Using IBM SPSS Statistics (4th ed.). London: SAGE Publication Ltd.","edition":"4"},{"issue":"12 Supplement","key":"2352_CR16","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"ML Fisher","year":"2004","unstructured":"Fisher, M. L. (2004). The lagrangian relaxation method for solving integer programming problems. Management Science, 50(12 Supplement), 1861\u20131871.","journal-title":"Management Science"},{"issue":"1112","key":"2352_CR17","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1016\/S0098-1354(01)00729-3","volume":"25","author":"I Harjunkoski","year":"2001","unstructured":"Harjunkoski, I., & Grossmann, I. E. (2001). A decomposition approach for the scheduling of a steel plant production. Computers and Chemical Engineering, 25(1112), 1647\u20131660.","journal-title":"Computers and Chemical Engineering"},{"issue":"4","key":"2352_CR18","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley, J. E. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8(4), 703\u2013712.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"2352_CR19","doi-asserted-by":"crossref","unstructured":"Laesanklang, W., Landa-Silva, D., & Castillo-Salazar, JA. (2015). Mixed integer programming with decomposition to solve a workforce scheduling and routing problem. In Proceedings of the 4th international conference on operations research and enterprise systems (ICORES 2015) (pp. 283\u2013293)","DOI":"10.5220\/0005223602830293"},{"key":"2352_CR20","unstructured":"Landa-Silva, D., Wang, Y., Donovan, P., Kendall, G., & Way, S. (2011). Hybrid heuristic for multi-carrier transportation plans. In The 9th Metaheuristics international conference (MIC 2011) (pp. 221\u2013229)"},{"issue":"1","key":"2352_CR21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10479-007-0212-2","volume":"155","author":"H Ni","year":"2007","unstructured":"Ni, H., & Abeledo, H. (2007). A branch-and-price approach for large-scale employee tour scheduling problems. Annals of Operations Research, 155(1), 167\u2013176.","journal-title":"Annals of Operations Research"},{"issue":"2, Part 2","key":"2352_CR22","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"HS Park","year":"2009","unstructured":"Park, H. S., & Jun, C. H. (2009). A simple and fast algorithm for k-medoids clustering. Expert Systems with Applications, 36(2, Part 2), 3336\u20133341.","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"2352_CR23","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0191-2615(85)90052-9","volume":"19","author":"J Perl","year":"1985","unstructured":"Perl, J., & Daskin, M. S. (1985). A warehouse location-routing problem. Transportation Research Part B: Methodological, 19(5), 381\u2013396.","journal-title":"Transportation Research Part B: Methodological"},{"key":"2352_CR24","unstructured":"Pillac, V., Gueret, C., & Medaglia, A. (2012). On the dynamic technician routing and scheduling problem. In Proceedings of the 5th international workshop on freight transportation and logistics (ODYSSEUS 2012), Mikonos, Greece"},{"key":"2352_CR25","unstructured":"Pinheiro, RL., & Landa-Silva, D. (2014). A development and integration framwork for optimisation-based enterprise solutions. In Proceedings of the 3rd international conference on operations research and enterprise systems (ICORES 2014) (pp. 233\u2013240)"},{"key":"2352_CR26","unstructured":"Pinheiro, RL., Laesanklang, W., Landa-Silva, D., Qu, R., Ward, R., & Doades, G.(2016). Benchmark dataset and results for a real-world workforce scheduling and routing problem in healthcare delivery (in revision)"},{"key":"2352_CR27","doi-asserted-by":"publisher","unstructured":"Pinheiro, RL., Landa-Silva, D., & Atkin, J. (2015). A variable neighbourhood search for the workforce scheduling and routing problem. In Advances in nature and biologically inspired computing. Springer International Publishing, pp. 247\u2013259. doi: 10.1007\/978-3-319-27400-3_22","DOI":"10.1007\/978-3-319-27400-3_22"},{"key":"2352_CR28","unstructured":"Ralphs, T. K., & Galati, M. V. (2010). Decomposition methods for integer programming. Wiley Encyclopedia of Operations Research and Management Science."},{"issue":"3","key":"2352_CR29","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","volume":"219","author":"MS Rasmussen","year":"2012","unstructured":"Rasmussen, M. S., Justesen, T., Dohn, A., & Larsen, J. (2012). The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research, 219(3), 598\u2013610.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"2352_CR30","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K., & Hartl, R. F. (2004). D-Ants: Savings based ants divide and conquer the vehicle routing problem. Computers and Operations Research, 31(4), 563\u2013591.","journal-title":"Computers and Operations Research"},{"issue":"1\u20134","key":"2352_CR31","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/B:ANOR.0000019101.29692.2c","volume":"128","author":"M Rekik","year":"2004","unstructured":"Rekik, M., Cordeau, J. F., & Soumis, F. (2004). Using benders decomposition to implicitly model tour scheduling. Annals of Operations Research, 128(1\u20134), 111\u2013133.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"2352_CR32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-6377(89)90055-2","volume":"8","author":"A Ruszczy\u0144ski","year":"1989","unstructured":"Ruszczy\u0144ski, A. (1989). An augmented lagrangian decomposition method for block diagonal linear programming problems. Operations Research Letters, 8(5), 287\u2013294.","journal-title":"Operations Research Letters"},{"key":"2352_CR33","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.omega.2013.06.006","volume":"43","author":"JJ Salazar-Gonz\u00e1lez","year":"2014","unstructured":"Salazar-Gonz\u00e1lez, J. J. (2014). Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier. Omega, 43, 71\u201382.","journal-title":"Omega"},{"issue":"6","key":"2352_CR34","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1021\/ie950467w","volume":"35","author":"S Subrahmanyam","year":"1996","unstructured":"Subrahmanyam, S., Pekny, J. F., & Reklaitis, G. V. (1996). Decomposition approaches to batch plant design and planning. Industrial and Engineering Chemistry Research, 35(6), 1866\u20131876.","journal-title":"Industrial and Engineering Chemistry Research"},{"issue":"8","key":"2352_CR35","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661\u2013673.","journal-title":"Networks"},{"key":"2352_CR36","first-page":"124","volume":"3","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser, A., & Hirsch, P. (2011). Optimization of daily scheduling for home health care services. Journal of Applied Operational Research, 3, 124\u2013136.","journal-title":"Journal of Applied Operational Research"},{"issue":"1","key":"2352_CR37","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck, F. (2000). On dantzig-wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Operations Research, 48(1), 111\u2013128.","journal-title":"Operations Research"},{"key":"2352_CR38","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/978-3-540-68279-0_13","volume-title":"50 Years of integer programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., & Wolsey, L. A. (2010). Reformulation and decomposition of integer programs. In M. J\u00fcnger, T. M. Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, & L. A. Wolsey (Eds.), 50 Years of integer programming 1958\u20132008 (pp. 431\u2013502). Berlin: Springer."},{"issue":"10","key":"2352_CR39","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"TH Wu","year":"2002","unstructured":"Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29(10), 1393\u20131415.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2352-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2352-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2352-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:56:09Z","timestamp":1568505369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2352-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2352"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2352-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,24]]}}}