{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T23:26:29Z","timestamp":1779924389892,"version":"3.53.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305223\/2015-1"],"award-info":[{"award-number":["305223\/2015-1"]}],"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":["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":["313601\/2018-6"],"award-info":[{"award-number":["313601\/2018-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["E-26\/202.887\/2017"],"award-info":[{"award-number":["E-26\/202.887\/2017"]}],"id":[{"id":"10.13039\/501100004586","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":["CAPES PrInt UFF no 88881"],"award-info":[{"award-number":["CAPES PrInt UFF no 88881"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10951-020-00640-z","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T05:03:27Z","timestamp":1580706207000},"page":"411-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the exact solution of a large class of parallel machine scheduling problems"],"prefix":"10.1007","volume":"23","author":[{"given":"Teobaldo","family":"Bulh\u00f5es","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruslan","family":"Sadykov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"key":"640_CR1","unstructured":"Achterberg, T. (2007). Constraint integer programming. PhD thesis, Technische Universitat Berlin."},{"issue":"2","key":"640_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/ijoc.1040.0069","volume":"17","author":"P Avella","year":"2005","unstructured":"Avella, P., Boccia, M., & D\u2019Auria, B. (2005). Near-optimal solutions of large-scale single-machine scheduling problems. INFORMS Journal on Computing, 17(2), 183\u2013191.","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"640_CR3","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., & Roberti, R. (2011). New route relaxation and pricing strategies for the vehicle routing problem. Operations Research, 59(5), 1269\u20131283.","journal-title":"Operations Research"},{"issue":"4","key":"640_CR4","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.disopt.2008.04.001","volume":"5","author":"LP Bigras","year":"2008","unstructured":"Bigras, L. P., Gamache, M., & Savard, G. (2008). The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times. Discrete Optimization, 5(4), 685\u2013699.","journal-title":"Discrete Optimization"},{"issue":"4","key":"640_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10951-014-0397-6","volume":"19","author":"A Bitar","year":"2016","unstructured":"Bitar, A., Dauz\u00e8re-P\u00e9r\u00e8s, S., Yugma, C., & Roussel, R. (2016). A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. Journal of Scheduling, 19(4), 367\u2013376.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"640_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10951-016-0485-x","volume":"20","author":"K B\u00fclb\u00fcl","year":"2017","unstructured":"B\u00fclb\u00fcl, K., & \u015een, H. (2017). An exact extended formulation for the unrelated parallel machine total weighted completion time problem. Journal of Scheduling, 20(4), 373\u2013389.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"640_CR7","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"ZL Chen","year":"1999","unstructured":"Chen, Z. L., & Powell, W. B. (1999). Solving parallel machine scheduling problems by column generation. INFORMS Journal on Computing, 11(1), 78\u201394.","journal-title":"INFORMS Journal on Computing"},{"key":"640_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129\u2013146.","journal-title":"Discrete Optimization"},{"key":"640_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","volume":"50","author":"C Gauvin","year":"2014","unstructured":"Gauvin, C., Desaulniers, G., & Gendreau, M. (2014). A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Computers & Operations Research, 50, 141\u2013153.","journal-title":"Computers & Operations Research"},{"key":"640_CR10","doi-asserted-by":"crossref","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In P. L.\u00a0Hammer, E. L. Johnson, & B. H. Korte (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. Elsevier, pp. 287\u2013326.","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"3","key":"640_CR11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","volume":"31","author":"I Ioachim","year":"1998","unstructured":"Ioachim, I., G\u00e9linas, S., Soumis, F., & Desrosiers, J. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks, 31(3), 193\u2013204.","journal-title":"Networks"},{"issue":"2","key":"640_CR12","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., & Pisinger, D. (2008). Subset-row inequalities applied to the vehicle-routing problem with time windows. Operations Research, 56(2), 497\u2013511.","journal-title":"Operations Research"},{"issue":"1","key":"640_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.1110.0399","volume":"47","author":"M Jepsen","year":"2013","unstructured":"Jepsen, M., Spoorendonk, S., & Ropke, S. (2013). A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Science, 47(1), 23\u201337.","journal-title":"Transportation Science"},{"issue":"9","key":"640_CR14","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/j.cor.2010.12.006","volume":"38","author":"A Jouglet","year":"2011","unstructured":"Jouglet, A., & Savourey, D. (2011). Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates. Computers & Operations Research, 38(9), 1259\u20131266.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"640_CR15","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1287\/ijoc.2018.0809","volume":"30","author":"D Kowalczyk","year":"2018","unstructured":"Kowalczyk, D., & Leus, R. (2018). A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching. INFORMS Journal on Computing, 30(4), 768\u2013782.","journal-title":"INFORMS Journal on Computing"},{"key":"640_CR16","unstructured":"Kramer, A. (2015). Um m\u00e9todo heur\u00edstico para a resolu\u00e7\u00e3o de uma classe de problemas de sequenciamento da produ\u00e7\u00e3o envolvendo penalidades por antecipa\u00e7\u00e3o e atraso. Master\u2019s thesis, Programa de P\u00f3s-Gradua\u00e7\u00e3o em Engenharia de Produ\u00e7\u00e3o, Universidade Federal da Para\u00edba, Jo\u00e3o Pessoa, Brazil (in Portuguese)."},{"issue":"1","key":"640_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10951-017-0549-6","volume":"22","author":"A Kramer","year":"2019","unstructured":"Kramer, A., & Subramanian, A. (2019). A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. Journal of Scheduling, 22(1), 21\u201357.","journal-title":"Journal of Scheduling"},{"key":"640_CR18","unstructured":"Lenstra, J., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. In P. L. Hammer, E. L. Johnson, & G. Nemhauser (Eds.), Studies in integer programming. Annals of discrete mathematics (Vol. 1, pp. 343\u2013362). Amsterdam: Elsevier."},{"issue":"12","key":"640_CR19","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/S0305-0548(02)00105-3","volume":"30","author":"CF Liaw","year":"2003","unstructured":"Liaw, C. F., Lin, Y. K., Cheng, C. Y., & Chen, M. (2003). Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research, 30(12), 1777\u20131789.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"640_CR20","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.cor.2006.07.010","volume":"35","author":"R Nessah","year":"2008","unstructured":"Nessah, R., Yalaoui, F., & Chu, C. (2008). A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Computers & Operations Research, 35(4), 1176\u20131190.","journal-title":"Computers & Operations Research"},{"key":"640_CR21","doi-asserted-by":"publisher","unstructured":"Oliveira, D., & Pessoa, A. (2019). An improved branch-cut-and-price algorithm for parallel machine scheduling problems. INFORMS Journal on Computing Articles in Advance. https:\/\/doi.org\/10.1287\/ijoc.2018.0854.","DOI":"10.1287\/ijoc.2018.0854"},{"issue":"2","key":"640_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TASE.2007.895005","volume":"5","author":"Y Pan","year":"2008","unstructured":"Pan, Y., & Shi, L. (2008). New hybrid optimization algorithms for machine scheduling problems. IEEE Transactions on Automation Science and Engineering, 5(2), 337\u2013348.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"3","key":"640_CR23","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Contardo, C., Desaulniers, G., & Uchoa, E. (2017a). New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS Journal on Computing, 29(3), 489\u2013502.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"640_CR24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","volume":"9","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Pessoa, A., Poggi, M., & Uchoa, E. (2017b). Improved branch-cut-and-price for capacitated vehicle routing. Mathematical Programming Computation, 9(1), 61\u2013100.","journal-title":"Mathematical Programming Computation"},{"issue":"3","key":"640_CR25","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1016\/j.ejor.2005.11.001","volume":"176","author":"MJ Pereira Lopes","year":"2007","unstructured":"Pereira Lopes, M. J., & Val\u00e9rio de Carvalho, J. (2007). A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research, 176(3), 1508\u20131527.","journal-title":"European Journal of Operational Research"},{"issue":"3\u20134","key":"640_CR26","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","volume":"2","author":"A Pessoa","year":"2010","unstructured":"Pessoa, A., Uchoa, E., Poggi, M., & Rodrigues, R. (2010). Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Mathematical Programming Computation, 2(3\u20134), 259\u2013290.","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"640_CR27","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","volume":"30","author":"A Pessoa","year":"2018","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., & Vanderbeck, F. (2018). Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS Journal on Computing, 30(2), 339\u2013360.","journal-title":"INFORMS Journal on Computing"},{"key":"640_CR28","first-page":"56","volume-title":"Annals of mathematical programming in Rio, B\u00fazios, Brazil","author":"M Poggi","year":"2003","unstructured":"Poggi, M., & Uchoa, E. (2003). Integer program reformulation for robust branch-and-cut-and-price. In L. Wolsey (Ed.), Annals of mathematical programming in Rio, B\u00fazios, Brazil (pp. 56\u201361). Rio de Janeiro, Brazil: COPPE Sistemas."},{"issue":"3","key":"640_CR29","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G Righini","year":"2006","unstructured":"Righini, G., & Salani, M. (2006). Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization, 3(3), 255\u2013273.","journal-title":"Discrete Optimization"},{"key":"640_CR30","unstructured":"R\u00f8pke, S. (2012). Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation In Column Generation 2012."},{"key":"640_CR31","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.cie.2014.04.001","volume":"72","author":"JE Schaller","year":"2014","unstructured":"Schaller, J. E. (2014). Minimizing total tardiness for scheduling identical parallel machines with family setups. Computers & Industrial Engineering, 72, 274\u2013281.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"640_CR32","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.2014.0615","volume":"27","author":"H \u015een","year":"2015","unstructured":"\u015een, H., & B\u00fclb\u00fcl, K. (2015). A strong preemptive relaxation for weighted tardiness and earliness\/tardiness problems on unrelated parallel machines. INFORMS Journal on Computing, 27(1), 135\u2013150.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"640_CR33","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1057\/palgrave.jors.2602141","volume":"58","author":"SO Shim","year":"2007","unstructured":"Shim, S. O., & Kim, Y. D. (2007a). Minimizing total tardiness in an unrelated parallel-machine scheduling problem. Journal of the Operational Research Society, 58(3), 346\u2013354.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"640_CR34","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.ejor.2005.09.038","volume":"177","author":"SO Shim","year":"2007","unstructured":"Shim, S. O., & Kim, Y. D. (2007b). Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operational Research, 177(1), 135\u2013146.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"640_CR35","doi-asserted-by":"crossref","first-page":"1849","DOI":"10.1016\/j.cor.2003.12.002","volume":"32","author":"F Sourd","year":"2005","unstructured":"Sourd, F. (2005). Earliness-tardiness scheduling with setup considerations. Computers & Operations Research, 32(7), 1849\u20131865.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"640_CR36","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1023\/A:1026224610295","volume":"6","author":"F Sourd","year":"2003","unstructured":"Sourd, F., & Kedad-Sidhoum, S. (2003). The one-machine problem with earliness and tardiness penalties. Journal of Scheduling, 6(6), 533\u2013549.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"640_CR37","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10951-007-0048-2","volume":"11","author":"F Sourd","year":"2008","unstructured":"Sourd, F., & Kedad-Sidhoum, S. (2008). A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, 11(1), 49\u201358.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"640_CR38","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.ijpe.2007.10.006","volume":"113","author":"S Tanaka","year":"2008","unstructured":"Tanaka, S., & Araki, M. (2008). A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines. International Journal of Production Economics, 113(1), 446\u2013458.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"640_CR39","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/j.cor.2012.07.004","volume":"40","author":"S Tanaka","year":"2013","unstructured":"Tanaka, S., & Araki, M. (2013). An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Computers & Operations Research, 40(1), 344\u2013352.","journal-title":"Computers & Operations Research"},{"key":"640_CR40","doi-asserted-by":"crossref","unstructured":"Tanaka, S., & Fujikuma, S. (2008). An efficient exact algorithm for general single-machine scheduling with machine idle time. In: IEEE international conference on automation science and engineering, 2008. CASE 2008, pp. 371\u2013376.","DOI":"10.1109\/COASE.2008.4626508"},{"issue":"3","key":"640_CR41","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10951-011-0242-0","volume":"15","author":"S Tanaka","year":"2012","unstructured":"Tanaka, S., & Fujikuma, S. (2012). A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. Journal of Scheduling, 15(3), 347\u2013361.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"640_CR42","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10951-008-0093-5","volume":"12","author":"S Tanaka","year":"2009","unstructured":"Tanaka, S., Fujikuma, S., & Araki, M. (2009). An exact algorithm for single-machine scheduling without machine idle time. Journal of Scheduling, 12(6), 575\u2013593.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"640_CR43","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J van den Akker","year":"2000","unstructured":"van den Akker, J., Hurkens, C., & Savelsbergh, M. (2000). Time-indexed formulations for machine scheduling problems: Column generation. INFORMS Journal on Computing, 12(2), 111\u2013124.","journal-title":"INFORMS Journal on Computing"},{"key":"640_CR44","unstructured":"Vanderbeck, F., Sadykov, R., & Tahiri, I. (2017). Bapcod\u2014A generic branch-and-price code. Technical report. https:\/\/realopt.bordeaux.inria.fr\/?page_id=2."},{"issue":"1","key":"640_CR45","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.ijpe.2004.11.002","volume":"100","author":"F Yalaoui","year":"2006","unstructured":"Yalaoui, F., & Chu, C. (2006). New exact method to solve the $${P}_m|r_j|\\sum {C}_j$$ schedule problem. International Journal of Production Economics, 100(1), 168\u2013179.","journal-title":"International Journal of Production Economics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00640-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-020-00640-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00640-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T00:38:59Z","timestamp":1612226339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-020-00640-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,3]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["640"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00640-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,3]]},"assertion":[{"value":"3 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}