{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:27:15Z","timestamp":1768548435793,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["71871080"],"award-info":[{"award-number":["71871080"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10951-019-00619-5","type":"journal-article","created":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T12:02:36Z","timestamp":1567857756000},"page":"649-664","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing"],"prefix":"10.1007","volume":"23","author":[{"given":"Shaojun","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,7]]},"reference":[{"key":"619_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.cor.2014.08.012","volume":"53","author":"F Ahmadizar","year":"2015","unstructured":"Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research, 53, 194\u2013205.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"619_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1504\/IJBIC.2018.090062","volume":"11","author":"T Alam","year":"2018","unstructured":"Alam, T., & Raza, Z. (2018). A bacterial foraging-based batch scheduling model for distributed systems. International Journal of Bio-Inspired Computation, 11(1), 16\u201326.","journal-title":"International Journal of Bio-Inspired Computation"},{"issue":"22","key":"619_CR3","doi-asserted-by":"crossref","first-page":"4713","DOI":"10.1080\/00207540600621029","volume":"44","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi, A., & Al-Anzi, F. S. (2006). Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research, 44(22), 4713\u20134735.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"619_CR4","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56(4), 1642\u20131661.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"619_CR5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10951-007-0043-7","volume":"10","author":"V Bouffard","year":"2007","unstructured":"Bouffard, V., & Ferland, J. A. (2007). Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem. Journal of Scheduling, 10(6), 375\u2013386.","journal-title":"Journal of Scheduling"},{"key":"619_CR6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efD","year":"2013","unstructured":"Boussa\u00efD, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences, 237, 82\u2013117.","journal-title":"Information Sciences"},{"issue":"6","key":"619_CR7","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1080\/0951192X.2016.1145805","volume":"30","author":"JC Chen","year":"2017","unstructured":"Chen, J. C., Chen, Y. Y., Chen, T. L., & Lin, J. Z. (2017). Comparison of simulated annealing and tabu-search algorithms in advanced planning and scheduling systems for TFT-LCD colour filter fabs. International Journal of Computer Integrated Manufacturing, 30(6), 516\u2013534.","journal-title":"International Journal of Computer Integrated Manufacturing"},{"issue":"12","key":"619_CR8","doi-asserted-by":"crossref","first-page":"1760","DOI":"10.1016\/j.cor.2010.11.014","volume":"38","author":"TE Cheng","year":"2011","unstructured":"Cheng, T. E., Hsu, C. J., Huang, Y. C., & Lee, W. C. (2011). Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness. Computers & Operations Research, 38(12), 1760\u20131765.","journal-title":"Computers & Operations Research"},{"issue":"18","key":"619_CR9","doi-asserted-by":"crossref","first-page":"3127","DOI":"10.1016\/j.ins.2009.05.002","volume":"179","author":"TE Cheng","year":"2009","unstructured":"Cheng, T. E., Lai, P. J., Wu, C. C., & Lee, W. C. (2009). Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations. Information Sciences, 179(18), 3127\u20133135.","journal-title":"Information Sciences"},{"issue":"1","key":"619_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"EG Coffman Jr","year":"1978","unstructured":"Coffman, E. G., Jr., Garey, M. R., & Johnson, D. S. (1978). An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 7(1), 1\u201317.","journal-title":"SIAM Journal on Computing"},{"key":"619_CR11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ins.2017.06.019","volume":"415","author":"LR Costa","year":"2017","unstructured":"Costa, L. R., Aloise, D., & Mladenovi\u0107, N. (2017). Less is more: Basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering. Information Sciences, 415, 247\u2013253.","journal-title":"Information Sciences"},{"issue":"7","key":"619_CR12","first-page":"1","volume":"10","author":"A El-Yaakoubi","year":"2017","unstructured":"El-Yaakoubi, A., El-Fallahi, A., Cherkaoui, M., & Hamzaoui, M. R. (2017). Tabu search and memetic algorithms for a real scheduling and routing problem. Logistics Research, 10(7), 1\u201318.","journal-title":"Logistics Research"},{"issue":"1","key":"619_CR47","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10898-017-0536-7","volume":"71","author":"W Fan","year":"2018","unstructured":"Fan, W., Pei, J., Liu, X., Pardalos, P. M., & Kong, M. (2018). Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning. Journal of Global Optimization, 71(1), 147\u2013163.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"619_CR13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","volume":"273","author":"JM Framinan","year":"2019","unstructured":"Framinan, J. M., Perez-Gonzalez, P., & Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273(2), 401\u2013417.","journal-title":"European Journal of Operational Research"},{"key":"619_CR14","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.asoc.2017.12.009","volume":"68","author":"Y Fu","year":"2018","unstructured":"Fu, Y., Ding, J., Wang, H., & Wang, J. (2018). Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in Industry 4.0-based manufacturing system. Applied Soft Computing, 68, 847\u2013855.","journal-title":"Applied Soft Computing"},{"key":"619_CR15","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"issue":"3","key":"619_CR17","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","volume":"103","author":"AMA Hariri","year":"1997","unstructured":"Hariri, A. M. A., & Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103(3), 547\u2013556.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"619_CR18","doi-asserted-by":"crossref","first-page":"2565","DOI":"10.1080\/00207540701725042","volume":"47","author":"J Jia","year":"2009","unstructured":"Jia, J., & Mason, S. J. (2009). Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research, 47(10), 2565\u20132585.","journal-title":"International Journal of Production Research"},{"issue":"6","key":"619_CR19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10951-018-0561-5","volume":"21","author":"D Kress","year":"2018","unstructured":"Kress, D., Barketau, M., & Pesch, E. (2018). Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines. Journal of Scheduling, 21(6), 595\u2013606.","journal-title":"Journal of Scheduling"},{"key":"619_CR20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.cie.2015.07.018","volume":"88","author":"CJ Liao","year":"2015","unstructured":"Liao, C. J., Lee, C. H., & Lee, H. C. (2015). An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan. Computers & Industrial Engineering, 88, 317\u2013325.","journal-title":"Computers & Industrial Engineering"},{"issue":"17","key":"619_CR21","doi-asserted-by":"crossref","first-page":"8848","DOI":"10.1016\/j.amc.2013.03.040","volume":"219","author":"P Liu","year":"2013","unstructured":"Liu, P., Yi, N., Zhou, X., & Gong, H. (2013). Scheduling two agents with sum-of-processing-times-based deterioration on a single machine. Applied Mathematics and Computation, 219(17), 8848\u20138855.","journal-title":"Applied Mathematics and Computation"},{"key":"619_CR22","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","volume":"66","author":"S Lu","year":"2018","unstructured":"Lu, S., Liu, X., Pei, J., Thai, M. T., & Pardalos, P. M. (2018). A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Applied Soft Computing, 66, 168\u2013182.","journal-title":"Applied Soft Computing"},{"key":"619_CR23","first-page":"1","volume":"57","author":"J Luo","year":"2018","unstructured":"Luo, J., Liu, Z., & Xing, K. (2018). Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with separated setup times. International Journal of Production Research, 57, 1\u201315.","journal-title":"International Journal of Production Research"},{"issue":"11","key":"619_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"619_CR25","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., & Uro\u0161evi\u0107, D. (2016). Less is more: Basic variable neighborhood search for minimum differential dispersion problem. Information Sciences, 326, 160\u2013171.","journal-title":"Information Sciences"},{"issue":"3","key":"619_CR26","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ejor.2011.06.037","volume":"215","author":"B Mor","year":"2011","unstructured":"Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215(3), 524\u2013531.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"619_CR27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10898-015-0320-5","volume":"67","author":"J Pei","year":"2017","unstructured":"Pei, J., Liu, X., Pardalos, P. M., Migdalas, A., & Yang, S. (2017). Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine. Journal of Global Optimization, 67(1\u20132), 251\u2013262.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"619_CR28","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"CN Potts","year":"1995","unstructured":"Potts, C. N., Sevast\u2019Janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., & Zwaneveld, C. M. (1995). The two-stage assembly scheduling problem: Complexity and approximation. Operations Research, 43(2), 346\u2013355.","journal-title":"Operations Research"},{"issue":"1\u20134","key":"619_CR29","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00170-015-6999-0","volume":"80","author":"P Renna","year":"2015","unstructured":"Renna, P., & Perrone, G. (2015). Order allocation in a multiple suppliers-manufacturers environment within a dynamic cluster. The International Journal of Advanced Manufacturing Technology, 80(1\u20134), 171\u2013182.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"619_CR30","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.ijpe.2013.04.013","volume":"147","author":"J Roh","year":"2014","unstructured":"Roh, J., Hong, P., & Min, H. (2014). Implementation of a responsive supply chain strategy in global complexity: The case of manufacturing firms. International Journal of Production Economics, 147, 198\u2013210.","journal-title":"International Journal of Production Economics"},{"issue":"6","key":"619_CR31","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei, V., Naderi, B., Jolai, F., & Khalili, M. (2009). A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Generation Computer Systems, 25(6), 654\u2013661.","journal-title":"Future Generation Computer Systems"},{"key":"619_CR32","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.ijpe.2017.10.015","volume":"195","author":"O Shahvari","year":"2018","unstructured":"Shahvari, O., & Logendran, R. (2018). A comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop with learning effect. International Journal of Production Economics, 195, 227\u2013248.","journal-title":"International Journal of Production Economics"},{"issue":"11","key":"619_CR33","doi-asserted-by":"crossref","first-page":"3087","DOI":"10.1080\/00207540903536155","volume":"49","author":"E Shokrollahpour","year":"2011","unstructured":"Shokrollahpour, E., Zandieh, M., & Dorri, B. (2011). A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research, 49(11), 3087\u20133103.","journal-title":"International Journal of Production Research"},{"issue":"5","key":"619_CR34","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1007\/s10845-015-1042-8","volume":"28","author":"F Tao","year":"2017","unstructured":"Tao, F., Cheng, Y., Zhang, L., & Nee, A. Y. (2017). Advanced manufacturing systems: Socialization characteristics and trends. Journal of Intelligent Manufacturing, 28(5), 1079\u20131094.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"4","key":"619_CR35","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.omega.2005.07.008","volume":"35","author":"JB Wang","year":"2007","unstructured":"Wang, J. B. (2007). Single-machine scheduling problems with the effects of learning and deterioration. Omega, 35(4), 397\u2013402.","journal-title":"Omega"},{"issue":"1","key":"619_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2006.01.017","volume":"178","author":"X Wang","year":"2007","unstructured":"Wang, X., & Cheng, T. E. (2007). Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. European Journal of Operational Research, 178(1), 57\u201370.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"619_CR37","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3934\/jimo.2016060","volume":"13","author":"JB Wang","year":"2017","unstructured":"Wang, J. B., Liu, M., Yin, N., & Ji, P. (2017). Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects. Journal of Industrial & Management Optimization, 13(2), 1025\u20131039.","journal-title":"Journal of Industrial & Management Optimization"},{"issue":"3","key":"619_CR38","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/j.ins.2010.10.001","volume":"181","author":"Y Wen","year":"2011","unstructured":"Wen, Y., Xu, H., & Yang, J. (2011). A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system. Information Sciences, 181(3), 567\u2013581.","journal-title":"Information Sciences"},{"issue":"9","key":"619_CR39","doi-asserted-by":"crossref","first-page":"3064","DOI":"10.1080\/00207543.2017.1401243","volume":"56","author":"CC Wu","year":"2018","unstructured":"Wu, C. C., Wang, D. J., Cheng, S. R., Chung, I. H., & Lin, W. C. (2018). A two-stage three-machine assembly scheduling problem with a position-based learning effect. International Journal of Production Research, 56(9), 3064\u20133079.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"619_CR40","doi-asserted-by":"crossref","first-page":"420","DOI":"10.15302\/J-FEM-2018050","volume":"5","author":"S Yang","year":"2018","unstructured":"Yang, S., Wang, J., Shi, L., Tan, Y., & Qiao, F. (2018). Engineering management for high-end equipment intelligent manufacturing. Frontiers of Engineering Management, 5(4), 420\u2013450.","journal-title":"Frontiers of Engineering Management"},{"issue":"2","key":"619_CR41","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Y Yin","year":"2013","unstructured":"Yin, Y., Cheng, T. C. E., Hsu, C. J., & Wu, C. C. (2013). Single-machine batch delivery scheduling with an assignable common due window. Omega, 41(2), 216\u2013225.","journal-title":"Omega"},{"issue":"11","key":"619_CR42","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1109\/TSMC.2015.2505644","volume":"46","author":"Y Yin","year":"2015","unstructured":"Yin, Y., Cheng, T. C. E., Wang, D., & Wu, C. C. (2015). Improved algorithms for single-machine serial-batch scheduling with rejection to minimize total completion time and total rejection cost. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 46(11), 1578\u20131588.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"619_CR43","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.omega.2016.07.006","volume":"69","author":"Y Yin","year":"2017","unstructured":"Yin, Y., Wang, Y., Cheng, T. C. E., Liu, W., & Li, J. (2017). Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega, 69, 17\u201328.","journal-title":"Omega"},{"key":"619_CR44","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, Y., Cheng, T. C. E., Wang, D. J., & Wu, C. C. (2016). Two-agent single-machine scheduling to minimize the batch delivery cost. Computers & Industrial Engineering, 92, 16\u201330.","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"619_CR45","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/nav.21813","volume":"65","author":"Y Yin","year":"2018","unstructured":"Yin, Y., Yang, Y., Wang, D., Cheng, T. C. E., & Wu, C. C. (2018). Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Research Logistics (NRL), 65(5), 393\u2013409.","journal-title":"Naval Research Logistics (NRL)"},{"key":"619_CR46","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cie.2017.12.013","volume":"116","author":"B Zhang","year":"2018","unstructured":"Zhang, B., Pan, Q. K., Gao, L., & Zhang, X. L. (2018). A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Computers & Industrial Engineering, 116, 22\u201336.","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00619-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00619-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00619-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T07:46:25Z","timestamp":1606290385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00619-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,7]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["619"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00619-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,7]]},"assertion":[{"value":"7 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}