{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:32Z","timestamp":1740122732732,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10732-024-09527-0","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T11:02:06Z","timestamp":1718017326000},"page":"225-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A large-scale neighborhood search algorithm for multi-activity tour scheduling problems"],"prefix":"10.1007","volume":"30","author":[{"given":"Rana","family":"Shariat","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7948-9800","authenticated-orcid":false,"given":"Kai","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"issue":"14","key":"9527_CR1","doi-asserted-by":"publisher","first-page":"12217","DOI":"10.1609\/aaai.v35i14.17450","volume":"35","author":"S Ahmadi","year":"2021","unstructured":"Ahmadi, S., Tack, G., Harabor, D.D., et al.: A fast exact algorithm for the resource constrained shortest path problem. Proc. AAAI Conf. Artif. Intell. 35(14), 12217\u201312224 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i14.17450","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"1","key":"9527_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1057\/palgrave.jors.2602294","volume":"59","author":"SM Al-Yakoob","year":"2008","unstructured":"Al-Yakoob, S.M., Sherali, H.D.: A column generation approach for an employee scheduling problem with multiple shifts and work locations. J. Oper. Res. Soc. 59(1), 34\u201343 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9527_CR3","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/mnsc.42.4.591","volume":"42","author":"T Aykin","year":"1996","unstructured":"Aykin, T.: Optimal shift scheduling with multiple break windows. Manage. Sci. 42(4), 591\u2013602 (1996)","journal-title":"Manage. Sci."},{"issue":"6","key":"9527_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1057\/palgrave.jors.2600472","volume":"49","author":"T Aykin","year":"1998","unstructured":"Aykin, T.: A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows. J. Oper. Res. Soc. 49(6), 603\u2013615 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9527_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0360-8352(85)90027-0","volume":"9","author":"J Bailey","year":"1985","unstructured":"Bailey, J.: Integrated days off and shift personnel scheduling. Comput. Ind. Eng. 9(4), 395\u2013404 (1985)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"9527_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1057\/jors.1976.30","volume":"27","author":"KR Baker","year":"1976","unstructured":"Baker, K.R.: Workforce allocation in cyclical scheduling problems: a survey. J. Oper. Res. Soc. 27(1), 155\u2013167 (1976)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"9527_CR7","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1287\/mnsc.36.11.1339","volume":"36","author":"SE Bechtold","year":"1990","unstructured":"Bechtold, S.E., Jacobs, L.W.: Implicit modeling of flexible break assignments in optimal shift scheduling. Manage. Sci. 36(11), 1339\u20131351 (1990)","journal-title":"Manage. Sci."},{"issue":"3","key":"9527_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/msom.1070.0172","volume":"10","author":"S Bhulai","year":"2008","unstructured":"Bhulai, S., Koole, G., Pot, A.: Simple methods for shift scheduling in multiskill call centers. Manuf. Serv. Oper. Manag. 10(3), 411\u2013420 (2008)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"2","key":"9527_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10479-016-2175-7","volume":"252","author":"A Bonutti","year":"2017","unstructured":"Bonutti, A., Ceschia, S., De Cesco, F., et al.: Modeling and solving a real-life multi-skill shift design problem. Ann. Oper. Res. 252(2), 365\u2013382 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9527_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10951-013-0338-9","volume":"17","author":"V Boyer","year":"2014","unstructured":"Boyer, V., Gendron, B., Rousseau, L.M.: A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem. J. Sched. 17(2), 185\u2013197 (2014)","journal-title":"J. Sched."},{"issue":"1","key":"9527_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10951-011-0265-6","volume":"16","author":"JO Brunner","year":"2013","unstructured":"Brunner, J.O., Bard, J.F.: Flexible weekly tour scheduling for postal service workers using a branch and price. J. Sched. 16(1), 129\u2013149 (2013)","journal-title":"J. Sched."},{"issue":"12","key":"9527_CR12","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1287\/mnsc.46.12.1630.12074","volume":"46","author":"MJ Brusco","year":"2000","unstructured":"Brusco, M.J., Jacobs, L.W.: Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Manage. Sci. 46(12), 1630\u20131641 (2000)","journal-title":"Manage. Sci."},{"issue":"2","key":"9527_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137\u2013167 (1959)","journal-title":"Inf. Control"},{"unstructured":"Cocke, J.: Programming Languages and their Compilers: Preliminary Notes. New York University (1969)","key":"9527_CR14"},{"issue":"1","key":"9527_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s10601-009-9083-2","volume":"16","author":"MC C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.C., Gendron, B., Quimper, C.G., et al.: Formal languages for integer programming modeling of shift scheduling problems. Constraints 16(1), 54\u201376 (2011)","journal-title":"Constraints"},{"issue":"1","key":"9527_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1287\/mnsc.1100.1264","volume":"57","author":"MC C\u00f4t\u00e9","year":"2011","unstructured":"C\u00f4t\u00e9, M.C., Gendron, B., Rousseau, L.M.: Grammar-based integer programming models for multiactivity shift scheduling. Manage. Sci. 57(1), 151\u2013163 (2011)","journal-title":"Manage. Sci."},{"issue":"3","key":"9527_CR17","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1287\/ijoc.1120.0514","volume":"25","author":"MC C\u00f4t\u00e9","year":"2013","unstructured":"C\u00f4t\u00e9, M.C., Gendron, B., Rousseau, L.M.: Grammar-based column generation for personalized multi-activity shift scheduling. INFORMS J. Comput. 25(3), 461\u2013474 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9527_CR18","first-page":"339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B.: A comment on edie\u2019s \u201ctraffic delays at toll booths\u2019\u2019. J. Oper. Res. Soc. Am. 2(3), 339\u2013341 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"doi-asserted-by":"crossref","unstructured":"Demassey, S., Pesant, G., Rousseau, L.M.: Constraint programming based column generation for employee timetabling. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31\u2013June 1, 2005. Proceedings 2, Springer, pp 140\u2013154 (2005)","key":"9527_CR19","DOI":"10.1007\/11493853_12"},{"issue":"4","key":"9527_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"issue":"3","key":"9527_CR21","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.ejor.2008.03.036","volume":"197","author":"B Detienne","year":"2009","unstructured":"Detienne, B., P\u00e9ridy, L., Pinson, \u00c9., et al.: Cut generation for an employee timetabling problem. Eur. J. Oper. Res. 197(3), 1178\u20131184 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9527_CR22","first-page":"107","volume":"2","author":"LC Edie","year":"1954","unstructured":"Edie, L.C.: Traffic delays at toll booths. J. Oper. Res. Soc. Am. 2(2), 107\u2013138 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"doi-asserted-by":"crossref","unstructured":"Gaspero, L.D., G\u00e4rtner, J., Musliu, N.: et\u00a0al.: A hybrid ls-cp solver for the shifts and breaks design problem. In: International Workshop on Hybrid Metaheuristics, Springer, pp 46\u201361 (2010)","key":"9527_CR23","DOI":"10.1007\/978-3-642-16054-7_4"},{"doi-asserted-by":"crossref","unstructured":"Gaspero, L.D., G\u00e4rtner, J., Musliu, N.: et\u00a0al.: Automated shift design and break scheduling. In: Automated Scheduling and Planning. Springer, pp. 109\u2013127 (2013)","key":"9527_CR24","DOI":"10.1007\/978-3-642-39304-4_5"},{"issue":"3","key":"9527_CR25","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.ejor.2016.01.036","volume":"252","author":"M G\u00e9rard","year":"2016","unstructured":"G\u00e9rard, M., Clautiaux, F., Sadykov, R.: Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252(3), 1019\u20131030 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9527_CR26","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.ejor.2018.07.010","volume":"272","author":"NA Hern\u00e1ndez-Leandro","year":"2019","unstructured":"Hern\u00e1ndez-Leandro, N.A., Boyer, V., Salazar-Aguilar, M.A., et al.: A matheuristic based on lagrangian relaxation for the multi-activity shift scheduling problem. Eur. J. Oper. Res. 272(3), 859\u2013867 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9527_CR27","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ejor.2010.09.004","volume":"209","author":"M Hojati","year":"2011","unstructured":"Hojati, M., Patil, A.S.: An integer linear programming-based heuristic for scheduling heterogeneous, part-time service employees. Eur. J. Oper. Res. 209(1), 37\u201350 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9527_CR28","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2018","unstructured":"Huangfu, Q., Hall, J.J.: Parallelizing the dual revised simplex method. Math. Program. Comput. 10(1), 119\u2013142 (2018). https:\/\/doi.org\/10.1007\/s12532-017-0130-5","journal-title":"Math. Program. Comput."},{"issue":"9","key":"9527_CR29","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1287\/mnsc.42.9.1247","volume":"42","author":"LW Jacobs","year":"1996","unstructured":"Jacobs, L.W., Brusco, M.J.: Overlapping start-time bands in implicit tour scheduling. Manage. Sci. 42(9), 1247\u20131259 (1996)","journal-title":"Manage. Sci."},{"issue":"1","key":"9527_CR30","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ejor.2006.10.039","volume":"184","author":"\u00d6 Kabak","year":"2008","unstructured":"Kabak, \u00d6., \u00dclengin, F., Akta\u015f, E., et al.: Efficient shift scheduling in the retail sector through two-stage optimization. Eur. J. Oper. Res. 184(1), 76\u201390 (2008)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Kasami, T.: An efficient recognition and syntax-analysis algorithm for context-free languages. University of Illinois at Urbana-Champaign Coordinated Science Laboratory Report no R-257 (1966)","key":"9527_CR31"},{"issue":"3","key":"9527_CR32","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/(SICI)1520-6750(200004)47:3<185::AID-NAV1>3.0.CO;2-7","volume":"47","author":"A Mehrotra","year":"2000","unstructured":"Mehrotra, A., Murphy, K.E., Trick, M.A.: Optimal shift scheduling: a branch-and-price approach. Nav. Res. Logist. 47(3), 185\u2013200 (2000)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"9527_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1024460714760","volume":"39","author":"A Meisels","year":"2003","unstructured":"Meisels, A., Schaerf, A.: Modelling and solving employee timetabling problems. Ann. Math. Artif. Intell. 39(1), 41\u201359 (2003)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"9527_CR34","first-page":"299","volume":"7","author":"SL Moondra","year":"1976","unstructured":"Moondra, S.L.: An lp model for work force scheduling for banks. J. Bank Res. 7(4), 299\u2013301 (1976)","journal-title":"J. Bank Res."},{"issue":"1","key":"9527_CR35","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0377-2217(03)00098-5","volume":"153","author":"N Musliu","year":"2004","unstructured":"Musliu, N., Schaerf, A., Slany, W.: Local search for shift design. Eur. J. Oper. Res. 153(1), 51\u201364 (2004)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Pan, S.: Exact and heuristic methods for multi-activity tour scheduling problems. Ph.D. thesis, Sorbonne Paris Cit\u00e9 (2018)","key":"9527_CR36"},{"unstructured":"Pan, S., Akplogan, M., L\u00e9tocart, L., et\u00a0al Solving a multi-activity shift scheduling problem with a tabu search heuristic. In: PATAT 2016: Proceedings of the 11th International Conference of the Practice and Theory of Automated Timetabling, pp. 317\u2013326 (2016)","key":"9527_CR37"},{"key":"9527_CR38","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.endm.2018.07.043","volume":"69","author":"S Pan","year":"2018","unstructured":"Pan, S., Akplogan, M., Touati, N., et al.: A hybrid heuristic for the multi-activity tour scheduling problem. Electron. Notes Discrete Math. 69, 333\u2013340 (2018)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"9527_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2006.10.028","volume":"184","author":"R Pastor","year":"2008","unstructured":"Pastor, R., Olivella, J.: Selecting and adapting weekly work schedules with working time accounts: a case of a retail clothing chain. Eur. J. Oper. Res. 184(1), 1\u201312 (2008)","journal-title":"Eur. J. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: International Conference on Principles and Practice of Constraint Programming, Springer, pp. 482\u2013495 (2004)","key":"9527_CR40","DOI":"10.1007\/978-3-540-30201-8_36"},{"doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of Metaheuristics. Springer, pp. 399\u2013419 (2010)","key":"9527_CR41","DOI":"10.1007\/978-1-4419-1665-5_13"},{"doi-asserted-by":"publisher","unstructured":"Qu, Y., Curtois, T.: Solving the multi-activity shift scheduling problem using variable neighbourhood search. In: Proceedings of the 9th International Conference on Operations Research and Enterprise Systems - ICORES, INSTICC. SciTePress, pp. 227\u2013232. https:\/\/doi.org\/10.5220\/0009118102270232 (2020)","key":"9527_CR42","DOI":"10.5220\/0009118102270232"},{"issue":"3","key":"9527_CR43","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10732-009-9106-6","volume":"16","author":"CG Quimper","year":"2010","unstructured":"Quimper, C.G., Rousseau, L.M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. J. Heurist. 16(3), 373\u2013392 (2010)","journal-title":"J. Heurist."},{"doi-asserted-by":"crossref","unstructured":"Quimper, C.G., Walsh, T.: Decomposing global grammar constraints. In: International Conference on Principles and Practice of Constraint Programming, Springer, pp. 590\u2013604 (2007)","key":"9527_CR44","DOI":"10.1007\/978-3-540-74970-7_42"},{"issue":"1","key":"9527_CR45","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ijpe.2012.06.030","volume":"140","author":"MI Restrepo","year":"2012","unstructured":"Restrepo, M.I., Lozano, L., Medaglia, A.L.: Constrained network-based column generation for the multi-activity shift scheduling problem. Int. J. Prod. Econ. 140(1), 466\u2013472 (2012)","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"9527_CR46","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1287\/ijoc.2015.0683","volume":"28","author":"MI Restrepo","year":"2016","unstructured":"Restrepo, M.I., Gendron, B., Rousseau, L.M.: Branch-and-price for personalized multiactivity tour scheduling. INFORMS J. Comput. 28(2), 334\u2013350 (2016)","journal-title":"INFORMS J. Comput."},{"key":"9527_CR47","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cor.2018.01.014","volume":"93","author":"MI Restrepo","year":"2018","unstructured":"Restrepo, M.I., Gendron, B., Rousseau, L.M.: Combining benders decomposition and column generation for multi-activity tour scheduling. Comput. Oper. Res. 93, 151\u2013165 (2018)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: International Conference on Principles and Practice of Constraint Programming, Springer, pp. 417\u2013431 (1998)","key":"9527_CR48","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"4","key":"9527_CR49","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/mnsc.41.4.595","volume":"41","author":"GM Thompson","year":"1995","unstructured":"Thompson, G.M.: Improved implicit optimal modeling of the labor shift scheduling problem. Manage. Sci. 41(4), 595\u2013607 (1995)","journal-title":"Manage. Sci."},{"issue":"2","key":"9527_CR50","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0019-9958(67)80007-X","volume":"10","author":"DH Younger","year":"1967","unstructured":"Younger, D.H.: Recognition and parsing of context-free languages in time n3. Inf. Control 10(2), 189\u2013208 (1967)","journal-title":"Inf. Control"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09527-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09527-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09527-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T07:07:51Z","timestamp":1729062471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09527-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":50,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9527"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09527-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"18 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}