{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T06:20:44Z","timestamp":1778739644317,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["428549\/2016-0"],"award-info":[{"award-number":["428549\/2016-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["307843\/2018-1"],"award-info":[{"award-number":["307843\/2018-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306033\/2019-4"],"award-info":[{"award-number":["306033\/2019-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10732-020-09461-x","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T12:06:50Z","timestamp":1604923610000},"page":"353-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Iterated local search for single machine total weighted tardiness batch scheduling"],"prefix":"10.1007","volume":"27","author":[{"given":"Eduardo","family":"Queiroga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian G. S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quentin","family":"Christ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur A.","family":"Pessoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"issue":"12","key":"9461_CR1","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1057\/jors.2010.186","volume":"62","author":"C Almeder","year":"2011","unstructured":"Almeder, C., M\u00f6nch, L.: Metaheuristics for scheduling jobs with incompatible families on parallel batching machines. J. Oper. Res. Soc. 62(12), 2083\u20132096 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"9461_CR2","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1080\/00207540310001636994","volume":"42","author":"H Balasubramanian","year":"2004","unstructured":"Balasubramanian, H., M\u00f6nch, L., Fowler, J., Pfund, M.: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int. J. Prod. Res. 42(8), 1621\u20131638 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"9461_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99849-7","volume-title":"Handbook on Scheduling","author":"J Blazewicz","year":"2019","unstructured":"Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Sterna, M., Weglarz, J.: Handbook on Scheduling. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-99849-7"},{"issue":"1","key":"9461_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. J. Sched. 1(1), 31\u201354 (1998)","journal-title":"J. Sched."},{"issue":"7","key":"9461_CR5","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00170-003-1740-9","volume":"24","author":"PC Chang","year":"2004","unstructured":"Chang, P.C., Wang, H.M.: A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes. Int. J. Adv. Manuf. Technol. 24(7), 615\u2013620 (2004)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"12","key":"9461_CR6","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1016\/j.cor.2010.03.017","volume":"37","author":"TC Chiang","year":"2010","unstructured":"Chiang, T.C., Cheng, H.C., Fu, L.C.: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Comput. Oper. Res. 37(12), 2257\u20132269 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9461_CR7","first-page":"136","volume":"25","author":"FD Chou","year":"2008","unstructured":"Chou, F.D., Wang, H.M.: Scheduling for a single semiconductor batch-processing machine to minimize total weighted tardiness. J. Chin. Inst. Ind. Eng. 25(2), 136\u2013147 (2008)","journal-title":"J. Chin. Inst. Ind. Eng."},{"issue":"3","key":"9461_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00170-005-0194-7","volume":"31","author":"FD Chou","year":"2006","unstructured":"Chou, F.D., Chang, P.C., Wang, H.M.: A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. Int. J. Adv. Manuf. Technol. 31(3), 350\u2013359 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"9461_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10479-007-0286-x","volume":"159","author":"V Erramilli","year":"2008","unstructured":"Erramilli, V., Mason, S.J.: Multiple orders per job batch scheduling with incompatible jobs. Ann. Oper. Res. 159(1), 245\u2013260 (2008)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"9461_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heur. 17(5), 487\u2013525 (2011). https:\/\/doi.org\/10.1007\/s10732-010-9143-1","journal-title":"J. Heur."},{"key":"9461_CR11","doi-asserted-by":"crossref","unstructured":"Graham, R., Lawler, E., Lenstra, J., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: PL\u00a0Hammer EJ, Korte B (eds) Discrete Optimization II Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium Co-sponsored by IBM Canada and SIAM Banff, Aha and Vancouver, Annals of Discrete Mathematics, vol.\u00a05, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"9461_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0167-6377(03)00064-6","volume":"32","author":"A Grosso","year":"2004","unstructured":"Grosso, A., Croce, F.D., Tadei, R.: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1), 68\u201372 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9461_CR13","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., P\u00e9rez, J.: Handbook of Metaheuristics. Springer, Chap Variable Neighborhood Search, pp. 61\u201386 (2010)","DOI":"10.1007\/978-1-4419-1665-5_3"},{"key":"9461_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.cie.2017.09.037","volume":"113","author":"M Hulett","year":"2017","unstructured":"Hulett, M., Damodaran, P., Amouie, M.: Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Comput. Ind. Eng. 113, 425\u2013436 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"9461_CR15","unstructured":"Kohn, R.: A Framework for Batch Scheduling with Variable Neighborhood Search in Wafer Fabrication. Ph.D. Thesis, Universit\u00e4t der Bundeswehr M\u00fcnchen (2015)"},{"issue":"6","key":"9461_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10951-018-0561-5","volume":"21","author":"D Kress","year":"2018","unstructured":"Kress, D., Barketau, M., Pesch, E.: Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. J. Sched. 21(6), 595\u2013606 (2018)","journal-title":"J. Sched."},{"issue":"1","key":"9461_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/00207540600786665","volume":"46","author":"ME Kurz","year":"2008","unstructured":"Kurz, M.E., Mason, S.J.: Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times. Int. J. Prod. Res. 46(1), 131\u2013151 (2008)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"9461_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/002075499192020","volume":"37","author":"CY Lee","year":"1999","unstructured":"Lee, C.Y.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. Int. J. Prod. Res. 37(1), 219\u2013236 (1999)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"9461_CR19","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Oper. Res. 40(4), 764\u2013775 (1992)","journal-title":"Oper. Res."},{"issue":"2","key":"9461_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.orl.2004.04.009","volume":"33","author":"S Li","year":"2005","unstructured":"Li, S., Li, G., Wang, X., Liu, Q.: Minimizing makespan on a single batching machine with release times and non-identical job sizes. Oper. Res. Lett. 33(2), 157\u2013164 (2005)","journal-title":"Oper. Res. Lett."},{"key":"9461_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 129\u2013168. Springer International Publishing, Cham (2019)"},{"issue":"7","key":"9461_CR22","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.tcs.2009.12.008","volume":"411","author":"S Lu","year":"2010","unstructured":"Lu, S., Feng, H., Li, X.: Minimizing the makespan on a single parallel batching machine. Theoret. Comput. Sci. 411(7), 1140\u20131145 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"22","key":"9461_CR23","doi-asserted-by":"publisher","first-page":"8947","DOI":"10.1016\/j.eswa.2015.07.050","volume":"42","author":"IC Martins","year":"2015","unstructured":"Martins, I.C., Pinheiro, R.G., Protti, F., Ochi, L.S.: A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Syst. Appl. 42(22), 8947\u20138955 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"9","key":"9461_CR24","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"M Mathirajan","year":"2006","unstructured":"Mathirajan, M., Sivakumar, A.: A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int. J. Adv. Manuf. Technol. 29(9), 990\u20131001 (2006)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"9","key":"9461_CR25","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1007\/s00170-009-2342-y","volume":"48","author":"M Mathirajan","year":"2010","unstructured":"Mathirajan, M., Bhargav, V., Ramachandran, V.: Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates. Int. J. Adv. Manuf. Technol. 48(9), 1133\u20131148 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9461_CR26","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.asoc.2017.10.028","volume":"68","author":"L M\u00f6nch","year":"2018","unstructured":"M\u00f6nch, L., Roob, S.: A matheuristic framework for batch machine scheduling problems with incompatible job families and regular sum objective. Appl. Soft Comput. 68, 835\u2013846 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"11","key":"9461_CR27","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L M\u00f6nch","year":"2005","unstructured":"M\u00f6nch, L., Balasubramanian, H., Fowler, J.W., Pfund, M.E.: Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res. 32(11), 2731\u20132750 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9461_CR28","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L M\u00f6nch","year":"2011","unstructured":"M\u00f6nch, L., Fowler, J., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S., Rose, O.: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J. Sched. 14(6), 583\u2013599 (2011)","journal-title":"J. Sched."},{"issue":"2","key":"9461_CR29","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heur. 19(2), 201\u2013232 (2013)","journal-title":"J. Heur."},{"issue":"2","key":"9461_CR30","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0305-0548(03)00239-9","volume":"32","author":"IC Perez","year":"2005","unstructured":"Perez, I.C., Fowler, J.W., Carlyle, W.: Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Comput. Oper. Res. 32(2), 327\u2013341 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9461_CR31","unstructured":"Pessoa, A., Bulh\u00f5es, T., Nesello, V., Subramanian, A.: Exact approaches for single machine total weighted tardiness batch scheduling, Working Paper (2020)"},{"key":"9461_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems. Springer International Publishing, Cham (2016)"},{"issue":"2","key":"9461_CR33","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","volume":"120","author":"CN Potts","year":"2000","unstructured":"Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228\u2013249 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9461_CR34","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C.N., Wassenhove, L.N.V.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43(5), 395\u2013406 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"9461_CR35","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2016.10.008","volume":"79","author":"A Subramanian","year":"2017","unstructured":"Subramanian, A., Farias, K.: Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. Comput. Oper. Res. 79, 190\u2013206 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9461_CR36","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.1080\/00207543.2014.883472","volume":"52","author":"A Subramanian","year":"2014","unstructured":"Subramanian, A., Battarra, M., Potts, C.: An iterated local search heuristic for the single machine total weighted tardiness problem with sequence-dependent setup times. Int. J. Prod. Res. 52(9), 2729\u20132742 (2014)","journal-title":"Int. J. Prod. Res."},{"issue":"7","key":"9461_CR37","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1080\/09537280600901467","volume":"17","author":"SK Tangudu","year":"2006","unstructured":"Tangudu, S.K., Kurz, M.E.: A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families. Prod. Plan. Control 17(7), 728\u2013741 (2006)","journal-title":"Prod. Plan. Control"},{"issue":"1","key":"9461_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/10556788.2014.890197","volume":"30","author":"R Toso","year":"2015","unstructured":"Toso, R., Resende, M.: A C++ application programming interface for biased random-key genetic algorithms. Optim. Methods Sotfw. 30(1), 81\u201393 (2015)","journal-title":"Optim. Methods Sotfw."},{"key":"9461_CR39","unstructured":"Velez-Gallego, M., Damodaran, P., Rodr\u00edguez, M.: Makespan minimization on a single batch processing machine with unequal job ready times. Int. J. Ind. Eng. Theory Appl. Pract. 18(10), (2011)"},{"key":"9461_CR40","unstructured":"V\u00e9lez-Gallego, M.C., Maya, J., Damodaran, P.: Minimizing total weighted tardiness on a batch-processing machine with non-identical job sizes and non-zero ready times. In: IIE Annual Conference on Proceedings, Institute of Industrial and Systems Engineers (IISE), p. 1 (2011)"},{"issue":"8","key":"9461_CR41","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen, A.P.J.: Priority rules for job shops with weighted tardiness costs. Manage. Sci. 33(8), 1035\u20131047 (1987)","journal-title":"Manage. Sci."},{"issue":"14","key":"9461_CR42","doi-asserted-by":"publisher","first-page":"4245","DOI":"10.1080\/00207543.2010.518995","volume":"49","author":"HM Wang","year":"2011","unstructured":"Wang, H.M.: Solving single batch-processing machine problems using an iterated heuristic. Int. J. Prod. Res. 49(14), 4245\u20134261 (2011)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"9461_CR43","first-page":"536","volume":"3","author":"HM Wang","year":"2013","unstructured":"Wang, H.M., Chou, F.D.: Bi-criteria single batch-processing machine with job release time and non-identical job sizes. Int. J. Inf. Educ. Technol. 3(5), 536 (2013)","journal-title":"Int. J. Inf. Educ. Technol."},{"issue":"3","key":"9461_CR44","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2011.05.011","volume":"39","author":"R Xu","year":"2012","unstructured":"Xu, R., Chen, H., Li, X.: Makespan minimization on single batch-processing machine via ant colony optimization. Comput. Oper. Res. 39(3), 582\u2013593 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"9461_CR45","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1080\/00207540600690537","volume":"45","author":"DJVD Zee","year":"2007","unstructured":"Zee, D.J.V.D.: Dynamic scheduling of batch-processing machines with non-identical product sizes. Int. J. Prod. Res. 45(10), 2327\u20132349 (2007)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"9461_CR46","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1080\/00207543.2013.854937","volume":"52","author":"S Zhou","year":"2014","unstructured":"Zhou, S., Chen, H., Xu, R., Li, X.: Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes. Int. J. Prod. Res. 52(8), 2258\u20132274 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"9461_CR47","unstructured":"Zinouri, N., Muskeyvalley, R., Damodaran, P., Ghrayeb, O.: Scheduling a batch processing machine to minimize total weighted tardiness. In: 62nd IIE Annual Conference and Expo 2012, pp. 692\u2013701. Institute of Industrial and Systems Engineers (IISE), Institute of Industrial Engineers (2012)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09461-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-020-09461-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-020-09461-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T09:31:12Z","timestamp":1621503072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-020-09461-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["9461"],"URL":"https:\/\/doi.org\/10.1007\/s10732-020-09461-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"18 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}