{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T10:08:02Z","timestamp":1784542082744,"version":"3.55.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006692","name":"Universit\u00e0 degli Studi di Torino","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006692","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Learning-based approaches have made substantial progress on solving combinatorial optimization problems, increasingly rivaling classical operations research methods. In particular, improvement-based machine learning methods, which iteratively refine an existing solution, have achieved state-of-the-art results on routing problems such as the traveling salesperson problem and the vehicle routing problem. Despite this success, analogous learning-based improvement methods for scheduling remain largely unexplored. To close this gap, we introduce a learning-based improvement method for scheduling based on the neural deconstruction framework, which improves solutions by iteratively applying a learned deconstruction policy followed by a simple repair strategy. We apply our method to both the classical and flexible job-shop scheduling problems. Our experimental results demonstrate that our method is able to outperform existing end-to-end and learning-augmented approaches on various well-known benchmark instances from the operations research literature.<\/jats:p>","DOI":"10.1007\/s10994-026-07116-9","type":"journal-article","created":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T09:39:23Z","timestamp":1784540363000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement Learning Guided Neural Deconstruction Search for Flexible Job Scheduling"],"prefix":"10.1007","volume":"115","author":[{"given":"Davide","family":"Zago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9","family":"Hottung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fynn Martin","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rossella","family":"Cancelliere","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Tierney","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"issue":"2","key":"7116_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/07408179508936739","volume":"27","author":"JW Barnes","year":"1995","unstructured":"Barnes, J. W., & Chambers, J. B. (1995). Solving the job shop scheduling problem with tabu search. IIE Transactions, 27(2), 257\u2013263.","journal-title":"IIE Transactions"},{"key":"7116_CR2","doi-asserted-by":"publisher","unstructured":"Bello, I., Pham, H., Le, Q. V., Norouzi, M., & Bengio, S. (2016). Neural combinatorial optimization with reinforcement learning. https:\/\/doi.org\/10.48550\/arXiv.1611.09940","DOI":"10.48550\/arXiv.1611.09940"},{"issue":"2","key":"7116_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwirth","year":"1995","unstructured":"Bierwirth, C. (1995). A generalized permutation approach to job shop scheduling with genetic algorithms. Operations-Research-Spektrum, 17(2), 87\u201392.","journal-title":"Operations-Research-Spektrum"},{"issue":"1","key":"7116_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"JH Blackstone","year":"1982","unstructured":"Blackstone, J. H., Phillips, D. T., & Hogg, G. L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, 20(1), 27\u201345.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"7116_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0377-2217(99)00486-5","volume":"127","author":"J B\u0142a\u017cewicz","year":"2000","unstructured":"B\u0142a\u017cewicz, J., Pesch, E., & Sterna, M. (2000). The disjunctive graph machine representation of the job shop scheduling problem. European Journal of Operational Research, 127(2), 317\u2013331.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7116_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations research, 41(3), 157\u2013183.","journal-title":"Annals of Operations research"},{"key":"7116_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106634","volume":"167","author":"P Brandimarte","year":"2024","unstructured":"Brandimarte, P., & Fadda, E. (2024). A reduced variable neighborhood search for the just in time job shop scheduling problem with sequence dependent setup times. Computers & Operations Research, 167, Article 106634.","journal-title":"Computers & Operations Research"},{"key":"7116_CR8","unstructured":"Brody, S., Alon, U., & Yahav, E. (2021). How attentive are graph attention networks? arXiv:2105.14491."},{"issue":"4","key":"7116_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., & Schlie, R. (1990). Job-shop scheduling with multi-purpose machines. Computing, 45(4), 369\u2013375.","journal-title":"Computing"},{"key":"7116_CR10","unstructured":"Cai, T., Luo, S., Xu, K., He, D., Liu, T.-Y., & Wang, L. (2021). . Graphnorm: A principled approach to accelerating graph neural network training. International Conference on Machine Learning, PMLR (pp. 1204\u20131215"},{"key":"7116_CR11","unstructured":"Dauzere-Peres, S., & Paulli, J. (1994). Solving the general multiprocessor job-shop scheduling problem"},{"issue":"1","key":"7116_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1998). Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1), 137\u2013141.","journal-title":"European Journal of Operational Research"},{"key":"7116_CR13","unstructured":"Falkner, J. K., & Schmidt-Thieme, L. (2020). Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention. arXiv:2006.09100."},{"key":"7116_CR14","doi-asserted-by":"publisher","unstructured":"Graviers, M.-E. C. des, Kobrosly, L., Guettier, C., & Cazenave, T. (2025).. Updating lower and upper bounds for the job-shop scheduling problem test instances. https:\/\/doi.org\/10.48550\/arXiv.2504.16106","DOI":"10.48550\/arXiv.2504.16106"},{"key":"7116_CR15","doi-asserted-by":"publisher","first-page":"48485","DOI":"10.52202\/075280-2105","volume":"36","author":"N Grinsztajn","year":"2023","unstructured":"Grinsztajn, N., Furelos-Blanco, D., Surana, S., Bonnet, C., & Barrett, T. (2023). Winner takes it all: Training performant RL populations for combinatorial optimization. Advances in Neural Information Processing Systems, 36, 48485\u201348509.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7116_CR16","doi-asserted-by":"crossref","unstructured":"Heinz, V., Hanz\u00e1lek, Z., & Vil\u00edm, P. (2024) Reinforcement learning for search tree size minimization in constraint programming: New results on scheduling benchmarks. Available at SSRN 4938242","DOI":"10.2139\/ssrn.4938242"},{"key":"7116_CR17","doi-asserted-by":"publisher","first-page":"14703","DOI":"10.1109\/ACCESS.2024.3357969","volume":"12","author":"KH Ho","year":"2024","unstructured":"Ho, K. H., Cheng, J. Y., Wu, J. H., Chiang, F., Chen, Y. C., Wu, Y. Y., & Wu, I. C. (2024). Residual scheduling: A new reinforcement learning approach to solving job shop scheduling problem. IEEE Access, 12, 14703\u201314718.","journal-title":"IEEE Access"},{"key":"7116_CR18","unstructured":"Hottung, A., Kwon, Y. D., & Tierney, K. (2022). Efficient active search for combinatorial optimization problems. International Conference on Learning Representations"},{"key":"7116_CR19","unstructured":"Hottung, A., Mahajan, M., & Tierney, K. (2024). Polynet: Learning diverse solution strategies for neural combinatorial optimization. The Thirteenth International Conference on Learning Representations"},{"key":"7116_CR20","unstructured":"Hottung, A., & Tierney, K. (2020). Neural large neighborhood search for the capacitated vehicle routing problem. Proceedings of the 24th European Conference on Artificial Intelligence (ECAI-20)"},{"key":"7116_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103786","volume":"313","author":"A Hottung","year":"2022","unstructured":"Hottung, A., & Tierney, K. (2022). Neural large neighborhood search for routing problems. Artificial Intelligence, 313, Article 103786.","journal-title":"Artificial Intelligence"},{"key":"7116_CR22","unstructured":"Hottung, A., Wong-Chung, P., & Tierney, K. (2025). Neural deconstruction search for vehicle routing problems. Transactions on Machine Learning Research,"},{"issue":"4","key":"7116_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink, J., Jurisch, B., & Thole, M. (1994). Tabu search for the job-shop scheduling problem with multi-purpose machines. Operations-Research-Spektrum, 15(4), 205\u2013215.","journal-title":"Operations-Research-Spektrum"},{"issue":"8","key":"7116_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10994-025-06826-w","volume":"114","author":"R Jv","year":"2025","unstructured":"Jv, R., Bukhsh, Z., & Zhang, Y. (2025). Offline reinforcement learning for learning to dispatch for job shop scheduling. Machine Learning, 114(8), 191.","journal-title":"Machine Learning"},{"key":"7116_CR25","unstructured":"Kool, W., van Hoof, H., & Welling, M. (2019). Attention, Learn to Solve Routing Problems!"},{"key":"7116_CR26","unstructured":"Kwon, Y. D., Choo, J., Kim, B., et al. (2020a). POMO: Policy Optimization with Multiple Optima for Reinforcement Learning. Advances in Neural Information Processing Systems, 33, 21188\u201321198."},{"key":"7116_CR28","unstructured":"Lan, L., & Berkhout, J. (2025). Pyjobshop: Solving scheduling problems with constraint programming in python. arXiv:2502.13483."},{"key":"7116_CR29","unstructured":"Lawrence, S. (1984). Resource constrained project scheduling. an experimental investigation of heuristic scheduling techniques"},{"key":"7116_CR30","first-page":"26198","volume":"34","author":"S Li","year":"2021","unstructured":"Li, S., Yan, Z., & Wu, C. (2021). Learning to delegate for large-scale vehicle routing. Advances in Neural Information Processing Systems, 34, 26198\u201326211.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7116_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2025.107139","volume":"182","author":"X Liu","year":"2025","unstructured":"Liu, X., Chen, X., Chau, V., Musial, J., & Blazewicz, J. (2025). Flexible job shop scheduling problem using graph neural networks and reinforcement learning. Computers & Operations Research, 182, Article 107139.","journal-title":"Computers &amp; Operations Research"},{"key":"7116_CR32","doi-asserted-by":"publisher","first-page":"8845","DOI":"10.52202\/075280-0387","volume":"36","author":"F Luo","year":"2023","unstructured":"Luo, F., Lin, X., Liu, F., Zhang, Q., & Wang, Z. (2023). Neural combinatorial optimization with heavy decoder: Toward large scale generalization. Advances in Neural Information Processing Systems, 36, 8845\u20138864.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"6","key":"7116_CR33","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797\u2013813.","journal-title":"Management science"},{"issue":"2","key":"7116_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki, E., & Smutnicki, C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8(2), 145\u2013159.","journal-title":"Journal of Scheduling"},{"key":"7116_CR35","unstructured":"Roy, B., & Sussmann, B. (1964). Les problemes d\u2019ordonnancement avec contraintes disjonctives Note ds 9."},{"issue":"2","key":"7116_CR36","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10696-021-09437-4","volume":"35","author":"M Saqlain","year":"2023","unstructured":"Saqlain, M., Ali, S., & Lee, J. (2023). A monte-carlo tree search algorithm for the flexible job-shop scheduling in manufacturing systems. Flexible Services and Manufacturing Journal, 35(2), 548\u2013571.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"11","key":"7116_CR37","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1080\/00207540600988105","volume":"46","author":"W Shi-Jin","year":"2008","unstructured":"Shi-Jin, W., Bing-Hai, Z., & Li-Feng, X. (2008). A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem. International Journal of Production Research, 46(11), 3027\u20133058.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"7116_CR38","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TII.2022.3189725","volume":"19","author":"W Song","year":"2022","unstructured":"Song, W., Chen, X., Li, Q., & Cao, Z. (2022). Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Transactions on Industrial Informatics, 19(2), 1600\u20131610.","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"7116_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119359","volume":"215","author":"K Sun","year":"2023","unstructured":"Sun, K., Zheng, D., Song, H., Cheng, Z., Lang, X., Yuan, W., & Wang, J. (2023). Hybrid genetic algorithm with variable neighborhood search for flexible job shop scheduling problem in a machining system. Expert Systems with Applications, 215, Article 119359.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"7116_CR40","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"7116_CR41","unstructured":"van Remmerden, J., Bukhsh, Z., Zhang, Y. (2025) Generalizing beyond suboptimality: Offline reinforcement learning learns effective scheduling through random data. arXiv:2509.10303."},{"key":"7116_CR42","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, \u0141., & Polosukhin, I. (2017). Attention is All you Need. Advances in Neural Information Processing Systems (p. 30)"},{"key":"7116_CR43","doi-asserted-by":"publisher","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., & Bengio, Y. (2017). Graph attention networks.\u00a0 https:\/\/doi.org\/10.48550\/arXiv.1710.10903","DOI":"10.48550\/arXiv.1710.10903"},{"key":"7116_CR44","unstructured":"Vinyals, O., Fortunato, M., & Jaitly, N. (2015). Pointer networks. Advances in Neural Information Processing Systems (pp. 2692\u20132700)"},{"issue":"3","key":"7116_CR45","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1109\/TNNLS.2023.3306421","volume":"35","author":"R Wang","year":"2023","unstructured":"Wang, R., Wang, G., Sun, J., Deng, F., & Chen, J. (2023). Flexible job shop scheduling via dual attention network-based reinforcement learning. IEEE Transactions on Neural Networks and Learning Systems, 35(3), 3091\u20133102.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"3","key":"7116_CR46","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1022672621406","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning, 8(3), 229\u2013256.","journal-title":"Machine learning"},{"key":"7116_CR47","doi-asserted-by":"crossref","unstructured":"Ye, H., Wang, J., Cao, Z., Liang, H., & Li, Y. (2023). Deepaco: Neural-enhanced ant systems for combinatorial optimization. In A. Oh, T. Naumann, A. Globerson, et al. (Eds.), Advances in Neural Information Processing Systems (Vol. 36, pp. 43706\u201343728). Curran Associates Inc.","DOI":"10.52202\/075280-1895"},{"key":"7116_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110436","volume":"143","author":"E Yuan","year":"2023","unstructured":"Yuan, E., Cheng, S., Wang, L., Song, S., & Wu, F. (2023). Solving job shop scheduling problems via deep reinforcement learning. Applied Soft Computing, 143, Article 110436.","journal-title":"Applied Soft Computing"},{"key":"7116_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.123019","volume":"245","author":"E Yuan","year":"2024","unstructured":"Yuan, E., Wang, L., Cheng, S., Song, S., Fan, W., & Li, Y. (2024). Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Systems with Applications, 245, Article 123019.","journal-title":"Expert Systems with Applications"},{"key":"7116_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106964","volume":"177","author":"F Yuraszeck","year":"2025","unstructured":"Yuraszeck, F., Mej\u00eda, G., Rossit, D. A., & L\u00fcer-Villagra, A. (2025). A constraint programming-based lower bounding procedure for the job shop scheduling problem. Computers & Operations Research, 177, Article 106964.","journal-title":"Computers &amp; Operations Research"},{"key":"7116_CR51","doi-asserted-by":"publisher","unstructured":"Zhang, C., Cao, Z., Song, W., Wu, Y., & Zhang, J. (2022) Deep reinforcement learning guided improvement heuristic for job shop scheduling. https:\/\/doi.org\/10.48550\/arXiv.2211.10936","DOI":"10.48550\/arXiv.2211.10936"},{"key":"7116_CR52","doi-asserted-by":"publisher","unstructured":"Zhang, C., Cao, Z., Wu, Y., Song, W., & Sun, J. (2024). Learning topological representations with bidirectional graph attention network for solving job shop scheduling problem. https:\/\/doi.org\/10.48550\/arXiv.2402.17606","DOI":"10.48550\/arXiv.2402.17606"},{"key":"7116_CR53","first-page":"1621","volume":"33","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P. S., & Chi, X. (2020) . Learning to dispatch for job shop scheduling via deep reinforcement learning. Advances in Neural Information Processing Systems, 33, 1621\u20131632.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7116_CR54","unstructured":"Zhao, H., & Xu, K. (2022). Learning efficient online 3d bin packing on packing configuration trees. International Conference on Learning Representations"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07116-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07116-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07116-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T09:39:30Z","timestamp":1784540370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07116-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"references-count":53,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["7116"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07116-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"19 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have conflics of interest with people with email domains of institutions: @unito.it, @uni-bielefeld.de, @univie.ac.at, @inaf.it, @fbk.eu The authors have conflics of interest with ECML 2026 Journal Track Guest Editorial Board Members: Livio Bioglio (@unito.it), Mattia Cerrato (@uni-mainz.de), Roberto Esposito (@unito.it), Ruggero G. Pensa (@unito.it) Researchers\/potential reviewers with competing interests that should not be considered for reviewers: Rosa Meo (@unito.it), Ann Now\u00e9 (@vub.ac.be), Jinkyoo Park (@kaist.ac.kr), Neil Yorke-Smith (@tudelft.nl), Yingqian Zhang (@tue.nl).","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"180"}}