{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T11:50:19Z","timestamp":1779882619209,"version":"3.53.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T00:00:00Z","timestamp":1750032000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T00:00:00Z","timestamp":1750032000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100021130","name":"Bundesministerium f\u00fcr Wirtschaft und Klimaschutz","doi-asserted-by":"publisher","award":["13IK033"],"award-info":[{"award-number":["13IK033"]}],"id":[{"id":"10.13039\/100021130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"publisher","award":["894072"],"award-info":[{"award-number":["894072"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004955","name":"\u00d6sterreichische Forschungsf\u00f6rderungsgesellschaft","doi-asserted-by":"publisher","award":["FO999910235"],"award-info":[{"award-number":["FO999910235"]}],"id":[{"id":"10.13039\/501100004955","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100031478","name":"NextGenerationEU","doi-asserted-by":"crossref","award":["PE00000004"],"award-info":[{"award-number":["PE00000004"]}],"id":[{"id":"10.13039\/100031478","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100031478","name":"NextGenerationEU","doi-asserted-by":"crossref","award":["ECS00000043"],"award-info":[{"award-number":["ECS00000043"]}],"id":[{"id":"10.13039\/100031478","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100031478","name":"NextGenerationEU","doi-asserted-by":"crossref","award":["C53D23003670006"],"award-info":[{"award-number":["C53D23003670006"]}],"id":[{"id":"10.13039\/100031478","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The scheduling of complex job shop manufacturing environments is a difficult and NP-hard optimization problem. It is tackled increasingly with AI-based methods, often by reinforcement learning approaches. So far, this is mostly an academic endeavor as the trust in such systems is limited. The neural networks representing the policy are often seen as a black box by domain experts. By proposing a holistic approach to make such policies more interpretable and explainable, we hope to bridge the gap between academia and industry. With increasing trust in the solution, it becomes closer to being deployed in a real manufacturing environment. We propose a combination of different statistical and well-established ML-based methodologies to analyze single state-action explanations as well as the overall strategy and apply them to pretrained agents on open-source benchmark simulation models. This allows us to deliver humanly understandable explanations for the policies of the analyzed agents.<\/jats:p>","DOI":"10.1007\/s10845-025-02631-3","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T06:19:00Z","timestamp":1750054740000},"page":"1999-2015","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Explainable AI for reinforcement learning based dynamic scheduling solutions in semiconductor manufacturing"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-9108-1947","authenticated-orcid":false,"given":"Alessandro","family":"Immordino","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1056-8233","authenticated-orcid":false,"given":"Patrick","family":"St\u00f6ckermann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0259-2829","authenticated-orcid":false,"given":"Niels","family":"Hayen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Altenm\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gian Antonio","family":"Susto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Gebser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantin","family":"Schekotihin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Seidel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,16]]},"reference":[{"key":"2631_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/J.ARTINT.2021.103502","volume":"298","author":"K Aas","year":"2021","unstructured":"Aas, K., Jullum, M., & L\u00f8land, A. (2021). Explaining individual predictions when features are dependent: More accurate approximations to shapley values. Artificial Intelligenc, 298, Article 103502. https:\/\/doi.org\/10.1016\/J.ARTINT.2021.103502","journal-title":"Artificial Intelligenc"},{"key":"2631_CR2","first-page":"1168","volume-title":"AAMAS","author":"D Amir","year":"2018","unstructured":"Amir, D., & Amir, O. (2018). HIGHLIGHTS: summarizing agent behavior to people. AAMAS (pp. 1168\u20131176). SC, USA \/ ACM: International Foundation for Autonomous Agents and Multiagent Systems Richland."},{"key":"2631_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/J.INFFUS.2019.12.012","volume":"58","author":"AB Arrieta","year":"2020","unstructured":"Arrieta, A. B., Rodr\u00edguez, N. D., Ser, J. D., et al. (2020). Explainable artificial intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI. Information fusion, 58, 82\u2013115. https:\/\/doi.org\/10.1016\/J.INFFUS.2019.12.012","journal-title":"Information fusion"},{"key":"2631_CR4","unstructured":"Bica, I., Jarrett, D., H\u00fcy\u00fck, A., et\u00a0al. (2021). Learning \u201cwhat-if\u201d explanations for sequential decision-making. In: ICLR. OpenReview.net"},{"key":"2631_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-27961-4","author":"TCT Chen","year":"2023","unstructured":"Chen, T. C. T. (2023). Explainable Artificial Intelligence (XAI) in Manufacturing: Methodology, Tools, and Applications. Springer International Publishing. https:\/\/doi.org\/10.1007\/978-3-031-27961-4","journal-title":"Springer International Publishing"},{"key":"2631_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2022.100249","volume":"9","author":"G Da Col","year":"2022","unstructured":"Da Col, G., & Teppan, E. C. (2022). Industrial-size job shop scheduling with constraint programming. Operations Research Perspectives, 9, Article 100249. https:\/\/doi.org\/10.1016\/j.orp.2022.100249","journal-title":"Operations Research Perspectives"},{"issue":"9","key":"2631_CR7","doi-asserted-by":"publisher","first-page":"194:1","DOI":"10.1145\/3561048","volume":"55","author":"R Dwivedi","year":"2023","unstructured":"Dwivedi, R., Dave, D., Naik, H., et al. (2023). Explainable AI (XAI): core ideas, techniques, and solutions. ACM Computing Surveys, 55(9), 194:1-194:33. https:\/\/doi.org\/10.1145\/3561048","journal-title":"ACM Computing Surveys"},{"key":"2631_CR8","doi-asserted-by":"publisher","unstructured":"El-Khouly, I. A., El-Kilany, K. S., & El-Sayed, A. E. (2009). Modelling and simulation of re-entrant flow shop scheduling: An application in semiconductor manufacturing. In: 2009 International Conference on Computers & Industrial Engineering. IEEE, pp 211\u2013216, https:\/\/doi.org\/10.1109\/ICCIE.2009.5223754","DOI":"10.1109\/ICCIE.2009.5223754"},{"issue":"2","key":"2631_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/MOOR.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of operations research, 1(2), 117\u2013129. https:\/\/doi.org\/10.1287\/MOOR.1.2.117","journal-title":"Mathematics of operations research"},{"key":"2631_CR10","unstructured":"Gottesman, O., Futoma, J., Liu, Y., et\u00a0al. (2020). Interpretable off-policy evaluation in reinforcement learning by highlighting influential transitions. In: ICML, Proceedings of Machine Learning Research, vol 119. PMLR, pp 3658\u20133667"},{"issue":"5","key":"2631_CR11","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1007\/S10618-022-00831-6","volume":"38","author":"R Guidotti","year":"2024","unstructured":"Guidotti, R. (2024). Counterfactual explanations and how to find them: literature review and benchmarking. Data Mining and Knowledge Discovery, 38(5), 2770\u20132824. https:\/\/doi.org\/10.1007\/S10618-022-00831-6","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"5","key":"2631_CR12","doi-asserted-by":"publisher","first-page":"93:1","DOI":"10.1145\/3236009","volume":"51","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., et al. (2019). A survey of methods for explaining black box models. ACM Computing Surveys, 51(5), 93:1-93:42. https:\/\/doi.org\/10.1145\/3236009","journal-title":"ACM Computing Surveys"},{"key":"2631_CR13","unstructured":"Guo, W., Wu, X., Khan, U., et\u00a0al. (2021). EDGE: explaining deep reinforcement learning policies. In: NeurIPS. Curran Associates, Inc."},{"issue":"2","key":"2631_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., & Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2), 159\u2013195. https:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evolutionary Computation"},{"key":"2631_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/J.KNOSYS.2020.106685","volume":"214","author":"A Heuillet","year":"2021","unstructured":"Heuillet, A., Couthouis, F., & Rodr\u00edguez, N. D. (2021). Explainability in deep reinforcement learning. Knowledge-Based Systems, 214, Article 106685. https:\/\/doi.org\/10.1016\/J.KNOSYS.2020.106685","journal-title":"Knowledge-Based Systems"},{"key":"2631_CR16","doi-asserted-by":"publisher","unstructured":"Hickling, T., Zenati, A., Aouf, N., et\u00a0al. (2024). Explainability in deep reinforcement learning: A review into current methods and applications. ACM Comput Surv 56(5):125:1\u2013125:35. https:\/\/doi.org\/10.1145\/3623377","DOI":"10.1145\/3623377"},{"key":"2631_CR17","doi-asserted-by":"publisher","unstructured":"Huang, S. H., Bhatia, K., Abbeel, P., et\u00a0al. (2018). Establishing appropriate trust via critical states. In: IROS. IEEE, pp 3929\u20133936, https:\/\/doi.org\/10.1109\/IROS.2018.8593649","DOI":"10.1109\/IROS.2018.8593649"},{"key":"2631_CR18","doi-asserted-by":"publisher","unstructured":"Kadir, M. A., Mosavi, A., & Sonntag, D. (2023). Evaluation metrics for xai: A review, taxonomy, and practical applications. In: INES. IEEE, pp 111\u2013124, https:\/\/doi.org\/10.1109\/INES59282.2023.10297629","DOI":"10.1109\/INES59282.2023.10297629"},{"key":"2631_CR19","doi-asserted-by":"publisher","unstructured":"Klemmt, A., Kutschke, J., & Schubert, C. (2017). From dispatching to scheduling: Challenges in integrating a generic optimization platform into semiconductor shop floor execution. In: WSC. IEEE, pp 3691\u20133702, https:\/\/doi.org\/10.1109\/WSC.2017.8248081","DOI":"10.1109\/WSC.2017.8248081"},{"key":"2631_CR20","unstructured":"Konda, V. R., & Tsitsiklis, J. N. (1999). Actor-critic algorithms. In: NIPS. The MIT Press, pp 1008\u20131014"},{"issue":"4","key":"2631_CR21","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/TSM.2020.3001933","volume":"33","author":"D Kopp","year":"2020","unstructured":"Kopp, D., Hassoun, M., Kalir, A., et al. (2020). Smt 2020a semiconductor manufacturing testbed. IEEE Transactions on Semiconductor Manufacturing, 33(4), 522\u2013531. https:\/\/doi.org\/10.1109\/TSM.2020.3001933","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"key":"2631_CR22","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs, B., Tassel, P., & Gebser, M. (2023). Optimizing dispatching strategies for semiconductor manufacturing facilities with genetic programming. In: GECCO. ACM, pp 1374\u20131382, https:\/\/doi.org\/10.1145\/3583131.3590402","DOI":"10.1145\/3583131.3590402"},{"key":"2631_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/J.COR.2016.04.006","volume":"73","author":"W Ku","year":"2016","unstructured":"Ku, W., & Beck, J. C. (2016). Mixed integer programming models for job shop scheduling: A computational analysis. Computers & Operations Research, 73, 165\u2013173. https:\/\/doi.org\/10.1016\/J.COR.2016.04.006","journal-title":"Computers & Operations Research"},{"issue":"19","key":"2631_CR24","doi-asserted-by":"publisher","first-page":"5812","DOI":"10.1080\/00207543.2021.1972179","volume":"60","author":"A Kuhnle","year":"2022","unstructured":"Kuhnle, A., May, M. C., Sch\u00e4fer, L., et al. (2022). Explainable reinforcement learning in production control of job shop manufacturing system. International Journal of Production Research, 60(19), 5812\u20135834. https:\/\/doi.org\/10.1080\/00207543.2021.1972179","journal-title":"International Journal of Production Research"},{"key":"2631_CR25","unstructured":"Lundberg, S. M., & Lee, S. (2017). A unified approach to interpreting model predictions. In: NIPS. Curran Associates, Inc., pp 4765\u20134774"},{"key":"2631_CR26","doi-asserted-by":"publisher","unstructured":"Milani, S., Topin, N., Veloso, M., et\u00a0al. (2024). Explainable reinforcement learning: A survey and comparative review. ACM Comput Surv 56(7):168:1\u2013168:36. https:\/\/doi.org\/10.1145\/3616864","DOI":"10.1145\/3616864"},{"key":"2631_CR27","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., et\u00a0al. (2013). Playing atari with deep reinforcement learning. CoRR abs\/1312.5602"},{"key":"2631_CR28","unstructured":"Mnih, V., Badia, A. P., Mirza, M., et\u00a0al. (2016). Asynchronous methods for deep reinforcement learning. In: ICML, JMLR Workshop and Conference Proceedings, vol\u00a048. JMLR.org, pp 1928\u20131937"},{"key":"2631_CR29","unstructured":"Molnar, C. (2022). Interpretable Machine Learning: A Guide for Making Black Box Models Explainable, 2nd edn."},{"issue":"6","key":"2631_CR30","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. W., Dauz\u00e8re-P\u00e9r\u00e8s, S., et al. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of scheduling, 14(6), 583\u2013599. https:\/\/doi.org\/10.1007\/S10951-010-0222-9","journal-title":"Journal of scheduling"},{"key":"2631_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4472-5","author":"L M\u00f6nch","year":"2013","unstructured":"M\u00f6nch, L., Fowler, J. W., & Mason, S. J. (2013). Production Planning and Control for Semiconductor Wafer Fabrication Facilities - Modeling, Analysis, and Systems, Operations research \/ computer science interfaces series, vol 52. Springer. https:\/\/doi.org\/10.1007\/978-1-4614-4472-5","journal-title":"Springer"},{"key":"2631_CR32","doi-asserted-by":"publisher","unstructured":"M\u00f8rch, N. J. S., Kjems, U., Hansen, L. K., et\u00a0al. (1995). Visualization of neural networks using saliency maps. In: ICNN. IEEE, pp 2085\u20132090, https:\/\/doi.org\/10.1109\/ICNN.1995.488997","DOI":"10.1109\/ICNN.1995.488997"},{"key":"2631_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/J.ARTINT.2021.103455","volume":"295","author":"ML Olson","year":"2021","unstructured":"Olson, M. L., Khanna, R., Neal, L., et al. (2021). Counterfactual state explanations for reinforcement learning agents via generative deep learning. Artificial Intelligence, 295, Article 103455. https:\/\/doi.org\/10.1016\/J.ARTINT.2021.103455","journal-title":"Artificial Intelligence"},{"key":"2631_CR34","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., et al. (2011). Scikit-learn: Machine learning in Python. The Journal of machine Learning research, 12, 2825\u20132830.","journal-title":"The Journal of machine Learning research"},{"key":"2631_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/J.COGSYS.2024.101243","volume":"86","author":"CO Retzlaff","year":"2024","unstructured":"Retzlaff, C. O., Angerschmid, A., Saranti, A., et al. (2024). Post-hoc vs ante-hoc explanations: xai design guidelines for data scientists. Cognitive Systems Research, 86, Article 101243. https:\/\/doi.org\/10.1016\/J.COGSYS.2024.101243","journal-title":"Cognitive Systems Research"},{"key":"2631_CR36","doi-asserted-by":"publisher","unstructured":"Ribeiro, M. T., Singh, S., & Guestrin, C. (2016). \u201cwhy should I trust you?\u201d: Explaining the predictions of any classifier. In: HLT-NAACL Demos. The Association for Computational Linguistics, pp 97\u2013101, https:\/\/doi.org\/10.18653\/V1\/N16-3020","DOI":"10.18653\/V1\/N16-3020"},{"key":"2631_CR37","unstructured":"Salimans, T., Ho, J., Chen, X., et\u00a0al. (2017). Evolution strategies as a scalable alternative to reinforcement learning. CoRR abs\/1703.03864"},{"key":"2631_CR38","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., et\u00a0al. (2017). Proximal policy optimization algorithms. CoRR abs\/1707.06347"},{"key":"2631_CR39","doi-asserted-by":"publisher","unstructured":"Shapley, L. S. (1953). 17. A Value for n-Person Games, Princeton University Press, pp 307\u2013318. https:\/\/doi.org\/10.1515\/9781400881970-018","DOI":"10.1515\/9781400881970-018"},{"key":"2631_CR40","doi-asserted-by":"publisher","unstructured":"Spier, J., & Kempf, K. (1995). Simulation of emergent behavior in manufacturing systems. In: ASMC. IEEE, pp 90\u201394, https:\/\/doi.org\/10.1109\/ASMC.1995.484347","DOI":"10.1109\/ASMC.1995.484347"},{"issue":"4","key":"2631_CR41","doi-asserted-by":"publisher","first-page":"957","DOI":"10.3390\/appliedmath3040049","volume":"3","author":"J Staudacher","year":"2023","unstructured":"Staudacher, J., & Pollmann, T. (2023). Assessing antithetic sampling for approximating shapley, banzhaf, and owen values. AppliedMath, 3(4), 957\u2013988. https:\/\/doi.org\/10.3390\/appliedmath3040049","journal-title":"AppliedMath"},{"key":"2631_CR42","doi-asserted-by":"publisher","unstructured":"St\u00f6ckermann, P., Immordino, A., Altenm\u00fcller, T., et\u00a0al. (2023). Dispatching in real frontend fabs with industrial grade discrete-event simulations by deep reinforcement learning with evolution strategies. In: WSC. IEEE, pp 3047\u20133058, https:\/\/doi.org\/10.1109\/WSC60868.2023.10408625","DOI":"10.1109\/WSC60868.2023.10408625"},{"issue":"3","key":"2631_CR43","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/S10115-013-0679-X","volume":"41","author":"E Strumbelj","year":"2014","unstructured":"Strumbelj, E., & Kononenko, I. (2014). Explaining prediction models and individual predictions with feature contributions. Knowledge and information systems, 41(3), 647\u2013665. https:\/\/doi.org\/10.1007\/S10115-013-0679-X","journal-title":"Knowledge and information systems"},{"key":"2631_CR44","doi-asserted-by":"crossref","unstructured":"St\u00f6ckermann, P., S\u00fcdfeld, H., Immordino, A, et\u00a0al. (2025). Scalability of reinforcement learning methods for dispatching in semiconductor frontend fabs: A comparison of open-source models with real industry datasets. CoRR abs\/2505.11135","DOI":"10.1007\/s00170-025-16117-2"},{"key":"2631_CR45","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement Learning: An Introduction. Adaptive Computation and Machine Learning Series: MIT Press."},{"key":"2631_CR46","doi-asserted-by":"publisher","unstructured":"Tassel, P., Kov\u00e1cs, B., Gebser, M, et\u00a0al. (2023). Semiconductor fab scheduling with self-supervised and reinforcement learning. In: WSC. IEEE, pp 1924\u20131935, https:\/\/doi.org\/10.1109\/WSC60868.2023.10407747","DOI":"10.1109\/WSC60868.2023.10407747"},{"key":"2631_CR47","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., et\u00a0al (2017).Attention is all you need. In: NIPS. Curran Associates, Inc., pp 5998\u20136008"},{"key":"2631_CR48","doi-asserted-by":"publisher","unstructured":"Vig, J. (2019). A multiscale visualization of attention in the transformer model. In: ACL (3). Association for Computational Linguistics, pp 37\u201342, https:\/\/doi.org\/10.18653\/V1\/P19-3007","DOI":"10.18653\/V1\/P19-3007"},{"key":"2631_CR49","unstructured":"Xu, K., Ba, J., Kiros, R., et\u00a0al. (2015). Show, attend and tell: Neural image caption generation with visual attention. In: ICML, JMLR Workshop and Conference Proceedings, vol\u00a037. JMLR.org, pp 2048\u20132057"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-025-02631-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10845-025-02631-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-025-02631-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T07:41:56Z","timestamp":1776411716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10845-025-02631-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,16]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2631"],"URL":"https:\/\/doi.org\/10.1007\/s10845-025-02631-3","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,16]]},"assertion":[{"value":"19 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2025","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised: The line breaks in the Algorithm 1 table has been corrected.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}]}}