{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:28:19Z","timestamp":1768004899224,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s12351-020-00615-0","type":"journal-article","created":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T06:02:52Z","timestamp":1609567372000},"page":"875-900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A coordinated scheduling problem for the supply chain in a flexible job shop machine environment"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3006-9768","authenticated-orcid":false,"given":"Zeynep","family":"Ceylan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Tozan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serol","family":"Bulkan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"615_CR1","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.dam.2005.04.019","volume":"154","author":"A Agnetis","year":"2006","unstructured":"Agnetis A, Hall NG, Pacciarelli D (2006) Supply chain scheduling: sequence coordination. Discret Appl Math 154:2044\u20132063. https:\/\/doi.org\/10.1016\/j.dam.2005.04.019","journal-title":"Discret Appl Math"},{"key":"615_CR2","doi-asserted-by":"publisher","first-page":"106003","DOI":"10.1016\/j.cie.2019.106003","volume":"137","author":"S Aminzadegan","year":"2019","unstructured":"Aminzadegan S, Tamannaei M, Rasti-Barzoki M (2019) Multi-agent supply chain scheduling problem by considering resource allocation and transportation. Comput Ind Eng 137:106003. https:\/\/doi.org\/10.1016\/j.cie.2019.106003","journal-title":"Comput Ind Eng"},{"key":"615_CR3","unstructured":"Augusto O, Fouad B, Caro S, Augusto O, Fouad B, Caro S, Method AN (2013) a new method for decision making in multi-objective optimization problems to cite this version\u202f: HAL Id\u202f: hal-00914025"},{"key":"615_CR4","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:369\u2013375. https:\/\/doi.org\/10.1007\/BF02238804","journal-title":"Computing"},{"key":"615_CR5","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10845-013-0837-8","volume":"26","author":"B \u00c7al\u0131\u015f","year":"2015","unstructured":"\u00c7al\u0131\u015f B, Bulkan S (2015) A research survey: review of AI solution strategies of job shop scheduling problem. J Intell Manuf 26:961\u2013973. https:\/\/doi.org\/10.1007\/s10845-013-0837-8","journal-title":"J Intell Manuf"},{"key":"615_CR6","first-page":"182","volume":"7","author":"Z Ceylan","year":"2019","unstructured":"Ceylan Z, Bulkan S, Tozan H (2019) Integrated supply chain scheduling models: a literature review. J Eng Sci Design 7:182\u2013195","journal-title":"J Eng Sci Design"},{"key":"615_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1111\/itor.12199","volume":"23","author":"IA Chaudhry","year":"2016","unstructured":"Chaudhry IA, Khan AA (2016) A research survey: review of flexible job shop scheduling techniques. Int Trans Oper Res 23:551\u2013591","journal-title":"Int Trans Oper Res"},{"key":"615_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z Chen","year":"2010","unstructured":"Chen Z (2010) Integrated production and outbound distribution scheduling. Rev Extens 58:130\u2013148. https:\/\/doi.org\/10.1287\/opre.1080.0688","journal-title":"Rev Extens"},{"key":"615_CR9","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"ZL Chen","year":"2005","unstructured":"Chen ZL, Vairaktarakis GL (2005) Integrated scheduling of production and distribution operations. Manag Sci 51:614\u2013628. https:\/\/doi.org\/10.1287\/mnsc.1040.0325","journal-title":"Manag Sci"},{"key":"615_CR10","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.compag.2019.04.041","volume":"162","author":"A Cheraghalipour","year":"2019","unstructured":"Cheraghalipour A, Paydar MM, Hajiaghaei-Keshteli M (2019) Designing and solving a bi-level model for rice supply chain using the evolutionary algorithms. Comput Electron Agric 162:651\u2013668. https:\/\/doi.org\/10.1016\/j.compag.2019.04.041","journal-title":"Comput Electron Agric"},{"key":"615_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","volume":"59","author":"M Dai","year":"2019","unstructured":"Dai M, Tang D, Giret A, Salido MA (2019) Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints. Robot Comput Integr Manuf 59:143\u2013157. https:\/\/doi.org\/10.1016\/j.rcim.2019.04.006","journal-title":"Robot Comput Integr Manuf"},{"key":"615_CR12","doi-asserted-by":"publisher","unstructured":"Demir Y, \u0130\u015fleyen SK (2014) An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations. https:\/\/doi.org\/10.1080\/00207543.2014.889328","DOI":"10.1080\/00207543.2014.889328"},{"key":"615_CR13","doi-asserted-by":"crossref","unstructured":"Donoso Y, Fabregat R (2016) Multi-objective optimization in computer networks using metaheuristics","DOI":"10.1201\/9781420013627"},{"key":"615_CR14","first-page":"72","volume":"10","author":"M Fadavi","year":"2017","unstructured":"Fadavi M, Sahraeian R, Rohaninejad M (2017) A new model for integrated lot sizing and scheduling in flexible job shop problem. J Ind Syst Eng 10:72\u201391","journal-title":"J Ind Syst Eng"},{"key":"615_CR15","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cie.2017.10.018","volume":"114","author":"\u00d6 Faruk","year":"2017","unstructured":"Faruk \u00d6, Pardalos PM (2017) Minimizing average lead time for the coordinated scheduling problem in a two-stage supply chain with multiple customers and multiple manufacturers. Comput Ind Eng 114:244\u2013257. https:\/\/doi.org\/10.1016\/j.cie.2017.10.018","journal-title":"Comput Ind Eng"},{"key":"615_CR16","doi-asserted-by":"publisher","first-page":"120824","DOI":"10.1016\/j.jclepro.2020.120824","volume":"259","author":"M Ganji","year":"2020","unstructured":"Ganji M, Kazemipoor H, Hadji Molana SM, Sajadi SM (2020) A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows. J Clean Prod 259:120824. https:\/\/doi.org\/10.1016\/j.jclepro.2020.120824","journal-title":"J Clean Prod"},{"key":"615_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/J.ASOC.2018.02.002","volume":"65","author":"A Gharaei","year":"2018","unstructured":"Gharaei A, Jolai F (2018) A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain. Appl Soft Comput 65:577\u2013589. https:\/\/doi.org\/10.1016\/J.ASOC.2018.02.002","journal-title":"Appl Soft Comput"},{"key":"615_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00536-7","author":"A Gharaei","year":"2019","unstructured":"Gharaei A, Jolai F (2019) A Pareto approach for the multi-factory supply chain scheduling and distribution problem. Oper Res. https:\/\/doi.org\/10.1007\/s12351-019-00536-7","journal-title":"Oper Res"},{"key":"615_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1080\/21681015.2019.1658136","volume":"36","author":"F Gholami","year":"2019","unstructured":"Gholami F, Paydar MM, Hajiaghaei-Keshteli M, Cheraghalipour A (2019) A multi-objective robust supply chain design considering reliability. J Ind Prod Eng 36:385\u2013400. https:\/\/doi.org\/10.1080\/21681015.2019.1658136","journal-title":"J Ind Prod Eng"},{"key":"615_CR20","doi-asserted-by":"publisher","first-page":"106007","DOI":"10.1016\/j.cie.2019.106007","volume":"137","author":"H Golp\u00eera","year":"2019","unstructured":"Golp\u00eera H, Tirkolaee EB (2019) Stable maintenance tasks scheduling: a bi-objective robust optimization model. Comput Ind Eng 137:106007. https:\/\/doi.org\/10.1016\/j.cie.2019.106007","journal-title":"Comput Ind Eng"},{"key":"615_CR21","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"NG Hall","year":"2003","unstructured":"Hall NG, Potts CN (2003) Supply chain scheduling: batching and delivery. Oper Res 51:566\u2013584","journal-title":"Oper Res"},{"key":"615_CR22","doi-asserted-by":"publisher","first-page":"2615","DOI":"10.1016\/j.eswa.2014.11.018","volume":"42","author":"S Hamid","year":"2015","unstructured":"Hamid S, Pasandideh R, Taghi S, Niaki A, Asadi K (2015) Expert systems with applications optimizing a bi-objective multi-product multi-period three echelon supply chain network with warehouse reliability. Expert Syst Appl 42:2615\u20132623. https:\/\/doi.org\/10.1016\/j.eswa.2014.11.018","journal-title":"Expert Syst Appl"},{"key":"615_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cie.2011.08.014","volume":"62","author":"A Hamidinia","year":"2012","unstructured":"Hamidinia A, Khakabimamaghani S, Mazdeh MM, Jafari M (2012) A genetic algorithm for minimizing total tardiness\/earliness of weighted jobs in a batched delivery system q. Comput Ind Eng 62:29\u201338. https:\/\/doi.org\/10.1016\/j.cie.2011.08.014","journal-title":"Comput Ind Eng"},{"key":"615_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.asoc.2016.08.019","volume":"49","author":"A Hassanzadeh","year":"2016","unstructured":"Hassanzadeh A, Rasti-barzoki M, Khosroshahi H (2016) Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl Soft Comput 49:335\u2013351","journal-title":"Appl Soft Comput"},{"key":"615_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1080\/17509653.2019.1592720","volume":"15","author":"F Isaloo","year":"2020","unstructured":"Isaloo F, Paydar MM (2020) Optimizing a robust bi-objective supply chain network considering environmental aspects: a case study in plastic injection industry. Int J Manag Sci Eng Manag 15:26\u201338. https:\/\/doi.org\/10.1080\/17509653.2019.1592720","journal-title":"Int J Manag Sci Eng Manag"},{"key":"615_CR26","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi H, Mazdeh MM, Rostami M (2017) The two stage assembly flow-shop scheduling problem with batching and delivery. Eng Appl Artif Intell 63:98\u2013107. https:\/\/doi.org\/10.1016\/j.engappai.2017.05.004","journal-title":"Eng Appl Artif Intell"},{"key":"615_CR27","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10479-017-2588-y","volume":"283","author":"S Khalilpourazari","year":"2019","unstructured":"Khalilpourazari S, Khamseh AA (2019) Bi-objective emergency blood supply chain network design in earthquake considering earthquake magnitude: a comprehensive study with real world application. Ann Oper Res 283:355\u2013393. https:\/\/doi.org\/10.1007\/s10479-017-2588-y","journal-title":"Ann Oper Res"},{"key":"615_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10479-007-0290-1","volume":"161","author":"UV Manoj","year":"2008","unstructured":"Manoj UV, Gupta JND, Gupta SK, Sriskandarajah C (2008) Supply chain scheduling: just-in-time environment. Ann Oper Res 161:53\u201386","journal-title":"Ann Oper Res"},{"key":"615_CR29","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1080\/23302674.2014.942408","volume":"1","author":"MM Mazdeh","year":"2014","unstructured":"Mazdeh MM, Rostami M (2014) A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs. Int J Syst Sci Oper Logist 1:94\u2013104. https:\/\/doi.org\/10.1080\/23302674.2014.942408","journal-title":"Int J Syst Sci Oper Logist"},{"key":"615_CR30","doi-asserted-by":"publisher","first-page":"491","DOI":"10.5267\/j.ijiec.2011.04.003","volume":"2","author":"MM Mazdeh","year":"2011","unstructured":"Mazdeh MM, Hamidinia A, Karamouzian A (2011) A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system. Int J Ind Eng Comput 2:491\u2013498. https:\/\/doi.org\/10.5267\/j.ijiec.2011.04.003","journal-title":"Int J Ind Eng Comput"},{"key":"615_CR31","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.asoc.2016.12.038","volume":"53","author":"C Min","year":"2017","unstructured":"Min C, Soo B (2017) Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks. Appl Soft Comput J 53:457\u2013476. https:\/\/doi.org\/10.1016\/j.asoc.2016.12.038","journal-title":"Appl Soft Comput J"},{"key":"615_CR32","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ijpe.2019.05.017","volume":"219","author":"S Mohammadi","year":"2020","unstructured":"Mohammadi S, Al-e-Hashem SMJM, Rekik Y (2020) An integrated production scheduling and delivery route planning with multi-purpose machines: a case study from a furniture manufacturing company. Int J Prod Econ 219:347\u2013359. https:\/\/doi.org\/10.1016\/j.ijpe.2019.05.017","journal-title":"Int J Prod Econ"},{"key":"615_CR33","doi-asserted-by":"publisher","unstructured":"Pei J, Liu X, Pardalos PM (2014) Application of an effective modified gravitational search algorithm for the coordinated scheduling problem in a two-stage supply chain, pp 335\u2013348. https:\/\/doi.org\/10.1007\/s00170-013-5263-8","DOI":"10.1007\/s00170-013-5263-8"},{"key":"615_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","volume":"82","author":"J Pei","year":"2019","unstructured":"Pei J, Liu X, Fan W, Pardalos PM, Lu S (2019) A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega 82:55\u201369. https:\/\/doi.org\/10.1016\/j.omega.2017.12.003","journal-title":"Omega"},{"key":"615_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling","author":"M Pinedo","year":"2012","unstructured":"Pinedo M (2012) Scheduling. Springer, Berlin"},{"key":"615_CR36","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.cie.2018.02.031","volume":"119","author":"H Rafiei","year":"2018","unstructured":"Rafiei H, Safaei F, Rabbani M (2018) Integrated production-distribution planning problem in a competition-based four-echelon supply chain. Comput Ind Eng 119:85\u201399. https:\/\/doi.org\/10.1016\/j.cie.2018.02.031","journal-title":"Comput Ind Eng"},{"key":"615_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/21681015.2018.1441195","volume":"1015","author":"E Rahimi","year":"2018","unstructured":"Rahimi E, Paydar MM, Mahdavi I, Jouzdani J (2018) A robust optimization model for multi-objective multi-period supply chain planning under uncertainty considering quantity discounts. J Ind Prod Eng 1015:1\u201315. https:\/\/doi.org\/10.1080\/21681015.2018.1441195","journal-title":"J Ind Prod Eng"},{"key":"615_CR38","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2013.01.002","volume":"228","author":"M Rasti-barzoki","year":"2013","unstructured":"Rasti-barzoki M, Hejazi SR (2013) Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains. Eur J Oper Res 228:345\u2013357. https:\/\/doi.org\/10.1016\/j.ejor.2013.01.002","journal-title":"Eur J Oper Res"},{"key":"615_CR39","doi-asserted-by":"publisher","first-page":"4909","DOI":"10.1016\/j.apm.2015.03.052","volume":"39","author":"M Rostami","year":"2015","unstructured":"Rostami M, Kheirandish O, Ansari N (2015) Minimizing maximum tardiness and delivery costs with batch delivery and job release times. Appl Math Model 39:4909\u20134927. https:\/\/doi.org\/10.1016\/j.apm.2015.03.052","journal-title":"Appl Math Model"},{"key":"615_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-018-0373-6","author":"M Rostami","year":"2018","unstructured":"Rostami M, Nikravesh S, Shahin M (2018) Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production. Oper Res. https:\/\/doi.org\/10.1007\/s12351-018-0373-6","journal-title":"Oper Res"},{"key":"615_CR41","doi-asserted-by":"publisher","unstructured":"Steiner G, Zhang R (2009) Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains, pp 565\u2013574. https:\/\/doi.org\/10.1007\/s10951-009-0109-9","DOI":"10.1007\/s10951-009-0109-9"},{"key":"615_CR42","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.cie.2018.11.003","volume":"127","author":"M Tamannaei","year":"2019","unstructured":"Tamannaei M, Rasti-Barzoki M (2019) Mathematical programming and solution approaches for minimizing tardiness and transportation costs in the supply chain scheduling problem. Comput Ind Eng 127:643\u2013656. https:\/\/doi.org\/10.1016\/j.cie.2018.11.003","journal-title":"Comput Ind Eng"},{"key":"615_CR43","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.962113","author":"A T\u00fcrky\u0131lmaz","year":"2015","unstructured":"T\u00fcrky\u0131lmaz A, Bulkan S (2015) A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2014.962113","journal-title":"Int J Prod Res"},{"key":"615_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-020-01547-4","author":"A T\u00fcrky\u0131lmaz","year":"2020","unstructured":"T\u00fcrky\u0131lmaz A, \u015eenvar \u00d6, \u00dcnal \u0130, Bulkan S (2020) A research survey: heuristic approaches for solving multi objective flexible job shop problems. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-020-01547-4","journal-title":"J Intell Manuf"},{"key":"615_CR45","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ejor.2012.11.049","volume":"227","author":"CA Ullrich","year":"2013","unstructured":"Ullrich CA (2013) Integrated machine scheduling and vehicle routing with time windows. Eur J Oper Res 227:152\u2013165. https:\/\/doi.org\/10.1016\/j.ejor.2012.11.049","journal-title":"Eur J Oper Res"},{"key":"615_CR46","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/J.COMPSTRUCT.2017.02.038","volume":"168","author":"T Vo-Duy","year":"2017","unstructured":"Vo-Duy T, Duong-Gia D, Ho-Huu V, Vu-Do HC, Nguyen-Thoi T (2017) Multi-objective optimization of laminated composite beam structures using NSGA-II algorithm. Compos Struct 168:498\u2013509. https:\/\/doi.org\/10.1016\/J.COMPSTRUCT.2017.02.038","journal-title":"Compos Struct"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00615-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00615-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00615-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T09:34:17Z","timestamp":1621589657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00615-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["615"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00615-0","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"24 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}