{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:33:32Z","timestamp":1782837212351,"version":"3.54.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10951-017-0523-3","type":"journal-article","created":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T11:18:30Z","timestamp":1493291910000},"page":"93-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Task assignment with start time-dependent processing times for personnel at check-in counters"],"prefix":"10.1007","volume":"21","author":[{"given":"Emilio","family":"Zamorano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Annika","family":"Becker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raik","family":"Stolletz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,27]]},"reference":[{"issue":"3","key":"523_CR1","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W., & Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46(3), 316\u2013329.","journal-title":"Operations Research"},{"issue":"2","key":"523_CR2","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.ejor.2014.04.004","volume":"238","author":"C Bode","year":"2014","unstructured":"Bode, C., & Irnich, S. (2014). The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem. European Journal of Operational Research, 238(2), 415\u2013426.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"523_CR3","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1287\/mnsc.45.5.722","volume":"45","author":"GM Campbell","year":"1999","unstructured":"Campbell, G. M. (1999). Cross-utilization of workers whose capabilities differ. Management Science, 45(5), 722\u2013732.","journal-title":"Management Science"},{"issue":"1","key":"523_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0377-2217(01)00107-2","volume":"138","author":"GM Campbell","year":"2002","unstructured":"Campbell, G. M., & Diaby, M. (2002). Development and evaluation of an assignment heuristic for allocating cross-trained workers. European Journal of Operational Research, 138(1), 9\u201320.","journal-title":"European Journal of Operational Research"},{"key":"523_CR5","unstructured":"Caseau, Y., & Koppstein, P. (1992). A cooperative-architecture expert system for solving large time\/travel assignment problems. In Database and expert systems applications (pp. 197\u2013202). Vienna: Springer."},{"issue":"7","key":"523_CR6","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi, E., & Tcha, D.-W. (2007). A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34(7), 2080\u20132095.","journal-title":"Computers and Operations Research"},{"key":"523_CR7","first-page":"157","volume-title":"The vehicle routing problem","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2001). The VRP with time windows. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp. 157\u2013193). Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"4","key":"523_CR8","doi-asserted-by":"crossref","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. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4), 393\u2013409.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"523_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.ijpe.2010.04.012","volume":"126","author":"A Corominas","year":"2010","unstructured":"Corominas, A., Olivella, J., & Pastor, R. (2010). A model for the assignment of a set of tasks when work performance depends on experience of all tasks involved. International Journal of Production Economics, 126(2), 335\u2013340.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"523_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ijpe.2005.05.015","volume":"103","author":"A Corominas","year":"2006","unstructured":"Corominas, A., Pastor, R., & Rodr\u00edguez, E. (2006). Rotational allocation of tasks to multifunctional workers in a service industry. International Journal of Production Economics, 103(1), 3\u20139.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"523_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/opre.2.3.339","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G. (1954). A comment on edie\u2019s \u201cTraffic Delays at Toll Booths\u201d. Journal of the Operations Research Society of America, 2(3), 339\u2013341.","journal-title":"Journal of the Operations Research Society of America"},{"issue":"2","key":"523_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., & Solomon, M. M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342\u2013354.","journal-title":"Operations Research"},{"issue":"4","key":"523_CR13","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"},{"issue":"5","key":"523_CR14","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","volume":"42","author":"M Dror","year":"1994","unstructured":"Dror, M. (1994). Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research, 42(5), 977\u2013978.","journal-title":"Operations Research"},{"issue":"1","key":"523_CR15","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.cor.2010.06.001","volume":"38","author":"E Edison","year":"2011","unstructured":"Edison, E., & Shima, T. (2011). Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms. Computers and Operations Research, 38(1), 340\u2013356.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"523_CR16","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.ejor.2005.01.011","volume":"171","author":"P Eveborn","year":"2006","unstructured":"Eveborn, P., Flisberg, P., & R\u00f6nnqvist, M. (2006). LAPS CARE\u2014an operational system for staff planning of home care. European Journal of Operational Research, 171(3), 962\u2013976.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"523_CR17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., & Gueguen, C. (2004). An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks, 44(3), 216\u2013229.","journal-title":"Networks"},{"issue":"6","key":"523_CR18","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1057\/jors.1988.97","volume":"39","author":"JA Ferland","year":"1988","unstructured":"Ferland, J. A., & Michelon, P. (1988). The vehicle scheduling problem with multiple vehicle types. Journal of the Operational Research Society, 39(6), 577\u2013583.","journal-title":"Journal of the Operational Research Society"},{"key":"523_CR19","unstructured":"Gleave, S. D. (2010). Possible revision of Directive 96\/67\/EC on access to the groundhandling market at Community airports. London."},{"key":"523_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume":"6730","author":"S Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G., & Solomon, M. M. (2005). Shortest path problems with resource constraints. Column Generation, 6730, 33\u201365.","journal-title":"Column Generation"},{"issue":"8","key":"523_CR21","doi-asserted-by":"crossref","first-page":"3748","DOI":"10.1016\/j.eswa.2013.11.029","volume":"41","author":"J Jiang","year":"2014","unstructured":"Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41(8), 3748\u20133760.","journal-title":"Expert Systems with Applications"},{"issue":"5","key":"523_CR22","doi-asserted-by":"crossref","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. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15(5), 579\u2013600.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"523_CR23","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ejor.2011.11.034","volume":"219","author":"M Krishnamoorthy","year":"2012","unstructured":"Krishnamoorthy, M., Ernst, A. T., & Baatar, D. (2012). Algorithms for large scale shift minimisation personnel task scheduling problems. European Journal of Operational Research, 219(1), 34\u201348.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"523_CR24","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/nav.20075","volume":"52","author":"Y Li","year":"2005","unstructured":"Li, Y., Lim, A., & Rodrigues, B. (2005). Manpower allocation with time windows and job-teaming constraints. Naval Research Logistics (NRL), 52(4), 302\u2013311.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"2","key":"523_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0377-2217(88)90369-4","volume":"33","author":"TT Liang","year":"1988","unstructured":"Liang, T. T., & Buclatin, B. B. (1988). Improving the utilization of training resources through optimal personnel assignment in the U.S. Navy. European Journal of Operational Research, 33(2), 183\u2013190.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"523_CR26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-010-0136-6","volume":"9","author":"F Liberatore","year":"2010","unstructured":"Liberatore, F., Righini, G., & Salani, M. (2010). A column generation algorithm for the vehicle routing problem with soft time windows. 4OR, 9(1), 49\u201382.","journal-title":"4OR"},{"key":"523_CR27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.orhc.2015.06.001","volume":"6","author":"A Lieder","year":"2015","unstructured":"Lieder, A., Moeke, D., Koole, G., & Stolletz, R. (2015). Task scheduling in long-term care facilities: A client-centered approach. Operations Research for Health Care, 6, 11\u201317.","journal-title":"Operations Research for Health Care"},{"issue":"5\u20138","key":"523_CR28","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1007\/s00170-013-5027-5","volume":"69","author":"C Liu","year":"2013","unstructured":"Liu, C., Yang, N., Li, W., Lian, J., Evans, S., & Yin, Y. (2013). Training and assignment of multi-skilled workers for implementing seru production systems. The International Journal of Advanced Manufacturing Technology, 69(5\u20138), 937\u2013959.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"4","key":"523_CR29","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1111\/j.1540-5915.1991.tb00361.x","volume":"22","author":"JS Loucks","year":"1991","unstructured":"Loucks, J. S., & Jacobs, F. R. (1991). Tour scheduling and task assignment of a heterogeneous work force: A heuristic approach. Decision Sciences, 22(4), 719\u2013738.","journal-title":"Decision Sciences"},{"issue":"6","key":"523_CR30","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M. E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"issue":"8","key":"523_CR31","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/0305-0548(95)00073-9","volume":"23","author":"JL Miller","year":"1996","unstructured":"Miller, J. L., & Franz, L. S. (1996). A binary-rounding heuristic for multi-period variable-task-duration assignment problems. Computers and Operations Research, 23(8), 819\u2013828.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"523_CR32","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1080\/00207543.2012.693645","volume":"51","author":"J Olivella","year":"2013","unstructured":"Olivella, J., Corominas, A., & Pastor, R. (2013). Task assignment considering cross-training goals and due dates. International Journal of Production Research, 51(3), 952\u2013962.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"523_CR33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20330","volume":"54","author":"A Pessoa","year":"2009","unstructured":"Pessoa, A., Uchoa, E., & Poggi de Arag\u00e3o, M. (2009). A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks, 54(4), 167\u2013177.","journal-title":"Networks"},{"key":"523_CR34","doi-asserted-by":"crossref","unstructured":"Smet, P., Wauters, T., Mihaylov, M., & Berghe, G. V. (2014). The shift minimisation personnel task scheduling problem: A new hybrid approach and computational insights. Omega, 46, 64\u201373.","DOI":"10.1016\/j.omega.2014.02.003"},{"issue":"2","key":"523_CR35","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265.","journal-title":"Operations Research"},{"issue":"1","key":"523_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M. M., & Desrosiers, J. (1988). Survey paper\u2014time window constrained routing and scheduling problems. Transportation Science, 22(1), 1\u201313.","journal-title":"Transportation Science"},{"issue":"3","key":"523_CR37","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.tre.2009.11.008","volume":"46","author":"R Stolletz","year":"2010","unstructured":"Stolletz, R. (2010). Operational workforce planning for check-in counters at airports. Transportation Research Part E: Logistics and Transportation Review, 46(3), 414\u2013425.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"523_CR38","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.tre.2014.05.002","volume":"68","author":"R Stolletz","year":"2014","unstructured":"Stolletz, R., & Zamorano, E. (2014). A rolling planning horizon heuristic for scheduling agents with different qualifications. Transportation Research Part E: Logistics and Transportation Review, 68, 39\u201352.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"523_CR39","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"Tsang, E., & Voudouris, C. (1997). Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Operations Research Letters, 20(3), 119\u2013127.","journal-title":"Operations Research Letters"},{"key":"523_CR40","unstructured":"Yang, R. (1996). Solving a workforce management problem with constraint programming. In The 2nd international conference on the practical application of constraint technology (pp. 373\u2013387). The Practical Application Company Ltd."},{"key":"523_CR41","doi-asserted-by":"crossref","unstructured":"Zamorano, E., & Stolletz, R. (2017). Branch-and-price approaches for the multiperiod technician routing and scheduling problem. European Journal of Operational Research, 257(1), 55\u201368.","DOI":"10.1016\/j.ejor.2016.06.058"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0523-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0523-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0523-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T08:34:59Z","timestamp":1518510899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0523-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["523"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0523-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,27]]}}}