{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:46:19Z","timestamp":1776753979912,"version":"3.51.2"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10951-025-00863-y","type":"journal-article","created":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:58:54Z","timestamp":1765295934000},"page":"143-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A scheduling game on parallel batch machines with setup cost"],"prefix":"10.1007","volume":"29","author":[{"given":"Guo-Qiang","family":"Fan","sequence":"first","affiliation":[]},{"given":"Jun-Qiang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,9]]},"reference":[{"issue":"1","key":"863_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ejor.2018.12.048","volume":"276","author":"A Agnetis","year":"2019","unstructured":"Agnetis, A., Chen, B., Nicosia, G., & Pacifici, A. (2019). Price of fairness in two-agent single-machine scheduling problems. European Journal of Operational Research, 276(1), 79\u201387.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"863_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times\/costs. European Journal of Operational Research, 246(2), 345\u2013378.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"863_CR3","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., & Soroush, H. (2008). The significance of reducing setup times\/setup costs. European Journal of Operational Research, 187(3), 978\u2013984.","journal-title":"European Journal of Operational Research"},{"key":"863_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.07.012","volume":"646","author":"G Avni","year":"2016","unstructured":"Avni, G., & Tamir, T. (2016). Cost-sharing scheduling games on restricted unrelated machines. Theoretical Computer Science, 646, 26\u201339.","journal-title":"Theoretical Computer Science"},{"key":"863_CR5","doi-asserted-by":"crossref","unstructured":"Aydinliyim T, & Vairaktarakis GL (2011) Sequencing strategies and coordination issues in outsourcing and subcontracting operations. In: Planning production and inventories in the extended enterprise, Springer, pp 269\u2013319.","DOI":"10.1007\/978-1-4419-6485-4_12"},{"issue":"3","key":"863_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/opre.2015.1363","volume":"63","author":"Y Azar","year":"2015","unstructured":"Azar, Y., Fleischer, L., Jain, K., Mirrokni, V., & Svitkina, Z. (2015). Optimal coordination mechanisms for unrelated machine scheduling. Operations Research, 63(3), 489\u2013500.","journal-title":"Operations Research"},{"key":"863_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 V (2006) On the packing of selfish items. In: Proceedings 20th IEEE international parallel & distributed processing symposium, IEEE, pp 9\u2013pp","DOI":"10.1109\/IPDPS.2006.1639283"},{"issue":"3","key":"863_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1287\/msom.1070.0152","volume":"9","author":"Y Bukchin","year":"2007","unstructured":"Bukchin, Y., & Hanany, E. (2007). Decentralization cost in scheduling: A game-theoretic approach. Manufacturing & Service Operations Management, 9(3), 263\u2013275.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"19","key":"863_CR9","doi-asserted-by":"publisher","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"PY Chang","year":"2004","unstructured":"Chang, P. Y., Damodaran, P., & Melouk, S. (2004). Minimizing Makespan on parallel batch processing machines. International Journal of Production Research, 42(19), 4211\u20134220.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"863_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10951-011-0247-8","volume":"15","author":"B Chen","year":"2012","unstructured":"Chen, B., & G\u00fcrel, S. (2012). Efficiency analysis of load balancing games with and without activation costs. Journal of Scheduling, 15(2), 157\u2013164.","journal-title":"Journal of Scheduling"},{"issue":"19","key":"863_CR11","doi-asserted-by":"publisher","first-page":"5755","DOI":"10.1080\/00207543.2010.512620","volume":"49","author":"H Chen","year":"2011","unstructured":"Chen, H., Du, B., & Huang, G. Q. (2011). Scheduling a batch processing machine with non-identical job sizes: a clustering perspective. International Journal of Production Research, 49(19), 5755\u20135778.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"863_CR12","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejor.2017.05.021","volume":"263","author":"Q Chen","year":"2017","unstructured":"Chen, Q., Lin, L., Tan, Z., & Yan, Y. (2017). Coordination mechanisms for scheduling games with proportional deterioration. European Journal of Operational Research, 263(2), 380\u2013389.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"863_CR13","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.apm.2011.09.061","volume":"36","author":"B Cheng","year":"2012","unstructured":"Cheng, B., Yang, S., Hu, X., & Chen, B. (2012). Minimizing Makespan and total completion time for parallel batch processing machines with non-identical job sizes. Applied Mathematical Modelling, 36(7), 3161\u20133167.","journal-title":"Applied Mathematical Modelling"},{"key":"863_CR14","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Koutsoupias E, & Nanavati A (2004) Coordination mechanisms. In: International colloquium on automata, languages, and programming, Springer, pp 345\u2013357","DOI":"10.1007\/978-3-540-27836-8_31"},{"issue":"1","key":"863_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-011-9316-9","volume":"49","author":"J Cohen","year":"2011","unstructured":"Cohen, J., D\u00fcrr, C., & Kim, T. N. (2011). Non-clairvoyant scheduling games. Theory of Computing Systems, 49(1), 3\u201323.","journal-title":"Theory of Computing Systems"},{"issue":"9\u201310","key":"863_CR16","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s00170-007-1042-8","volume":"37","author":"P Damodaran","year":"2008","unstructured":"Damodaran, P., & Chang, P. Y. (2008). Heuristics to minimize makespan of parallel batch processing machines. The International Journal of Advanced Manufacturing Technology, 37(9\u201310), 1005\u20131013.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"863_CR17","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1016\/j.ijpe.2006.02.010","volume":"103","author":"P Damodaran","year":"2006","unstructured":"Damodaran, P., Manjeshwar, P. K., & Srihari, K. (2006). Minimizing Makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics, 103(2), 882\u2013891.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"863_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10951-018-0587-8","volume":"22","author":"G D\u00f3sa","year":"2019","unstructured":"D\u00f3sa, G., & Epstein, L. (2019). Quality of strong equilibria for selfish bin packing with uniform cost sharing. Journal of Scheduling, 22(4), 473\u2013485.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"863_CR19","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G Dosa","year":"2014","unstructured":"Dosa, G., Tan, Z., Tuza, Z., Yan, Y., & L\u00e1nyi, C. S. (2014). Improved bounds for batch scheduling with nonidentical job sizes. Naval Research Logistics, 61(5), 351\u2013358.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"863_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ejor.2019.04.026","volume":"278","author":"G D\u00f3sa","year":"2019","unstructured":"D\u00f3sa, G., Kellerer, H., & Tuza, Z. (2019). Using weight decision for decreasing the price of anarchy in selfish bin packing games. European Journal of Operational Research, 278(1), 160\u2013169.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"863_CR21","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/S0305-0548(00)00078-2","volume":"29","author":"L Dupont","year":"2002","unstructured":"Dupont, L., & Dhaenens-Flipo, C. (2002). Minimizing the Makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research, 29(7), 807\u2013819.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"863_CR22","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-009-9348-6","volume":"60","author":"L Epstein","year":"2011","unstructured":"Epstein, L., & Kleiman, E. (2011). Selfish bin packing. Algorithmica, 60(2), 368\u2013394.","journal-title":"Algorithmica"},{"issue":"05","key":"863_CR23","doi-asserted-by":"publisher","first-page":"1850033","DOI":"10.1142\/S0217595918500331","volume":"35","author":"GQ Fan","year":"2018","unstructured":"Fan, G. Q., & Nong, Q. Q. (2018). A coordination mechanism for a scheduling game with uniform-batching machines. Asia-Pacific Journal of Operational Research, 35(05), 1850033.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"3","key":"863_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/opre.1120.1051","volume":"60","author":"M Feldman","year":"2012","unstructured":"Feldman, M., & Tamir, T. (2012). Conflicting congestion effects in resource allocation games. Operations Research, 60(3), 529\u2013540.","journal-title":"Operations Research"},{"issue":"36","key":"863_CR25","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D Fotakis","year":"2009","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., & Spirakis, P. (2009). The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science, 410(36), 3305\u20133326.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"863_CR26","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1080\/0740817X.2013.851432","volume":"46","author":"NK Freeman","year":"2014","unstructured":"Freeman, N. K., Mittenthal, J., & Melouk, S. H. (2014). Parallel-machine scheduling to minimize overtime and waste costs. IIE Transactions, 46(6), 601\u2013618.","journal-title":"IIE Transactions"},{"key":"863_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"863_CR28","doi-asserted-by":"crossref","unstructured":"Hall NG, & Liu Z (2008) Cooperative and noncooperative games for capacity planning and scheduling. In: State-of-the-Art Decision-Making Tools in the Information-Intensive Age, INFORMS, pp 108\u2013129","DOI":"10.1287\/educ.1080.0041"},{"issue":"17","key":"863_CR29","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L. E., Mirrokni, V. S., & Schulz, A. S. (2009). Coordination mechanisms for selfish scheduling. Theoretical Computer Science, 410(17), 1589\u20131598.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"863_CR30","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2014.07.039","volume":"240","author":"ZH Jia","year":"2015","unstructured":"Jia, Z. H., & Leung, J. Y. T. (2015). A meta-heuristic to minimize Makespan for parallel batch machines with arbitrary job sizes. European Journal of Operational Research, 240(3), 649\u2013665.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"863_CR31","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1080\/00207540500525254","volume":"44","author":"AH Kashan","year":"2006","unstructured":"Kashan, A. H., Karimi, B., & Jolai, F. (2006). Effective hybrid genetic algorithm for minimizing Makespan on a single-batch-processing machine with non-identical job sizes. International Journal of Production Research, 44(12), 2337\u20132360.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"863_CR32","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"AH Kashan","year":"2008","unstructured":"Kashan, A. H., Karimi, B., & Jenabi, M. (2008). A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Computers & Operations Research, 35(4), 1084\u20131098.","journal-title":"Computers & Operations Research"},{"key":"863_CR33","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, & Papadimitriou C (1999) Worst\u2013case equilibria. In: Annual symposium on theoretical aspects of computer science, Springer, pp 404\u2013413","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"4","key":"863_CR34","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C. Y., Uzsoy, R., & Martin-Vega, L. A. (1992). Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research, 40(4), 764\u2013775.","journal-title":"Operations Research"},{"key":"863_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.tcs.2015.05.035","volume":"607","author":"L Lin","year":"2015","unstructured":"Lin, L., Xian, X., Yan, Y., He, X., & Tan, Z. (2015). Inefficiency of equilibria for scheduling game with machine activation costs. Theoretical Computer Science, 607, 193\u2013207.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"863_CR36","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1007\/s10898-012-9856-9","volume":"56","author":"R Ma","year":"2013","unstructured":"Ma, R., D\u00f3sa, G., Han, X., Ting, H. F., Ye, D., & Zhang, Y. (2013). A note on a selfish bin packing problem. Journal of Global Optimization, 56(4), 1457\u20131462.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"863_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"S Melouk","year":"2004","unstructured":"Melouk, S., Damodaran, P., & Chang, P. Y. (2004). Minimizing Makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics, 87(2), 141\u2013147.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"863_CR38","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s40305-016-0134-2","volume":"4","author":"QQ Nong","year":"2016","unstructured":"Nong, Q. Q., Guo, S. J., & Miao, L. H. (2016). The shortest first coordination mechanism for a scheduling game with parallel-batching machines. Journal of the Operations Research Society of China, 4(4), 517\u2013527.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"2","key":"863_CR39","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10878-015-9980-9","volume":"33","author":"QQ Nong","year":"2017","unstructured":"Nong, Q. Q., Fan, G. Q., & Fang, Q. Z. (2017). A coordination mechanism for a scheduling game with parallel-batching machines. Journal of Combinatorial Optimization, 33(2), 567\u2013579.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"863_CR40","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/s10878-017-0201-6","volume":"35","author":"QQ Nong","year":"2018","unstructured":"Nong, Q. Q., Sun, T., Cheng, T. C. E., & Fang, Q. Z. (2018). Bin packing game with a price of anarchy of $$\\frac{3}{2}$$. Journal of Combinatorial Optimization, 35(2), 632\u2013640.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"10","key":"863_CR41","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1016\/j.cor.2009.12.007","volume":"37","author":"NR Parsa","year":"2010","unstructured":"Parsa, N. R., Karimi, B., & Kashan, A. H. (2010). A branch and price algorithm to minimize Makespan on a single batch processing machine with non-identical job sizes. Computers & Operations Research, 37(10), 1720\u20131730.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"863_CR42","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(98)00391-9","volume":"120","author":"CS Sung","year":"2000","unstructured":"Sung, C. S., & Choung, Y. I. (2000). Minimizing Makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research, 120(3), 559-574.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"863_CR43","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32(7), 1615\u20131635.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"863_CR44","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/msom.1120.0410","volume":"15","author":"GL Vairaktarakis","year":"2013","unstructured":"Vairaktarakis, G. L. (2013). Noncooperative games for subcontracting operations. Manufacturing & Service Operations Management, 15(1), 148\u2013158.","journal-title":"Manufacturing & Service Operations Management"},{"key":"863_CR45","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2015.02.023","volume":"580","author":"F Xie","year":"2015","unstructured":"Xie, F., Xu, Z., Zhang, Y., & Bai, Q. (2015). Scheduling games on uniform machines with activation cost. Theoretical Computer Science, 580, 28\u201335.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"863_CR46","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ipl.2015.10.006","volume":"116","author":"F Xie","year":"2016","unstructured":"Xie, F., Zhang, Y., Bai, Q., & Xu, Z. (2016). Inefficiency analysis of the scheduling game on limited identical machines with activation costs. Information Processing Letters, 116(4), 316\u2013320.","journal-title":"Information Processing Letters"},{"key":"863_CR47","doi-asserted-by":"crossref","unstructured":"Yu G, & Zhang G (2008) Bin packing of selfish items. In: International Workshop on Internet and Network Economics, Springer, pp 446\u2013453","DOI":"10.1007\/978-3-540-92185-1_50"},{"key":"863_CR48","doi-asserted-by":"crossref","unstructured":"Zhang C, & Zhang G (2017) Cost\u2013sharing mechanisms for selfish bin packing. In: International conference on combinatorial optimization and applications, Springer, pp 355\u2013368","DOI":"10.1007\/978-3-319-71150-8_30"},{"issue":"3","key":"863_CR49","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., Lee, C. Y., & Wong, C. K. (2001). Minimizing Makespan on a single batch processing machine with nonidentical job sizes. Naval Research Logistics, 48(3), 226\u2013240.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00863-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-025-00863-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-025-00863-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:01:52Z","timestamp":1776751312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-025-00863-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,9]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["863"],"URL":"https:\/\/doi.org\/10.1007\/s10951-025-00863-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,9]]},"assertion":[{"value":"4 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}