{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:58:36Z","timestamp":1781168316476,"version":"3.54.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T00:00:00Z","timestamp":1509667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12351-017-0358-x","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T16:18:29Z","timestamp":1509725909000},"page":"857-897","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A lagrangian relaxation algorithm for facility location of resource-constrained decentralized multi-project scheduling problems"],"prefix":"10.1007","volume":"20","author":[{"given":"Mohammad","family":"Rostami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Morteza","family":"Bagherpour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,3]]},"reference":[{"key":"358_CR1","doi-asserted-by":"crossref","unstructured":"Abdelmaguid TF, Elrashidy W (2016) Halting decisions for gas pipeline construction projects using AHP: a case study. Oper Res Int J 1\u201321. doi: https:\/\/doi.org\/10.1007\/s12351-016-0277-2","DOI":"10.1007\/s12351-016-0277-2"},{"issue":"1\u20134","key":"358_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1023\/A:1016046625583","volume":"108","author":"NR Achuthan","year":"2001","unstructured":"Achuthan NR, Hardjawidjaja A (2001) Project scheduling under time dependent costs\u2014a branch and bound algorithm. Ann Oper Res 108(1\u20134):55\u201374","journal-title":"Ann Oper Res"},{"issue":"1","key":"358_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz B, Laguna M (2006) Fine-tuning of algorithms using fractional experimental designs and local search. Oper Res Int J 54(1):99\u2013114","journal-title":"Oper Res Int J"},{"issue":"2","key":"358_CR4","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.ijpe.2013.08.013","volume":"146","author":"S Adhau","year":"2013","unstructured":"Adhau S, Mittal ML, Mittal A (2013) A multi-agent system for decentralized multi-project scheduling with resource transfers. Int J Prod Econ 146(2):646\u2013661","journal-title":"Int J Prod Econ"},{"issue":"1","key":"358_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2010.01.007","volume":"38","author":"A Agarwal","year":"2011","unstructured":"Agarwal A, Colak S, Erenguc S (2011) A neurogenetic approach for the resource-constrained project scheduling problem. Comput Oper Res 38(1):44\u201350","journal-title":"Comput Oper Res"},{"issue":"2","key":"358_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ijpe.2004.04.002","volume":"96","author":"MA Al-Fawzan","year":"2005","unstructured":"Al-Fawzan MA, Haouari M (2005) A bi-objective model for robust resource-constrained project scheduling. Int J Prod Econ 96(2):175\u2013187","journal-title":"Int J Prod Econ"},{"key":"358_CR7","unstructured":"Bartz-Beielstein T, Parsopoulos KE, Vrahatis MN (2004) Analysis of particle swarm optimization using computational statistics. In Proceedings of the international conference of numerical analysis and applied mathematics (ICNAAM 2004), pp 34\u201337"},{"issue":"1","key":"358_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1504\/IJOR.2016.073250","volume":"25","author":"VS Bilolikar","year":"2016","unstructured":"Bilolikar VS, Jain K, Sharma M (2016) An adaptive crossover genetic algorithm with simulated annealing for multi mode resource constrained project scheduling with discounted cash flows. Int J Oper Res 25(1):28\u201346","journal-title":"Int J Oper Res"},{"issue":"1","key":"358_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10479-014-1555-0","volume":"217","author":"A Can","year":"2014","unstructured":"Can A, Ulusoy G (2014) Multi-project scheduling with two-stage decomposition. Ann Oper Res 217(1):95\u2013116","journal-title":"Ann Oper Res"},{"key":"358_CR10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.autcon.2013.10.002","volume":"37","author":"M-Y Cheng","year":"2014","unstructured":"Cheng M-Y, Tran D-H, Wu Y-W (2014) Using a fuzzy clustering chaotic-based differential evolution with serial method to solve resource-constrained project scheduling problems. Autom Constr 37:88\u201397","journal-title":"Autom Constr"},{"key":"358_CR11","volume-title":"Theory of scheduling. 1967, Theory of Scheduling","author":"RW Conway","year":"1967","unstructured":"Conway RW, Maxwell WL, Miller LW (1967) Theory of scheduling. 1967, Theory of Scheduling. Palo Alto, London"},{"issue":"5","key":"358_CR12","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.cor.2011.07.010","volume":"39","author":"C Fang","year":"2012","unstructured":"Fang C, Wang L (2012) An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput Oper Res 39(5):890\u2013901","journal-title":"Comput Oper Res"},{"key":"358_CR13","doi-asserted-by":"crossref","unstructured":"Fink A, Homberger J (2015) Decentralized multi-project scheduling. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol. 2 (International Handbooks on Information Systems). Springer, New York, pp 685\u2013706","DOI":"10.1007\/978-3-319-05915-0_2"},{"issue":"2","key":"358_CR14","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"ML Fisher","year":"1985","unstructured":"Fisher ML (1985) An applications oriented guide to Lagrangian relaxation. Interfaces 15(2):10\u201321","journal-title":"Interfaces"},{"key":"358_CR15","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.autcon.2012.11.014","volume":"30","author":"P Ghoddousi","year":"2013","unstructured":"Ghoddousi P et al (2013) Multi-mode resource-constrained discrete time\u2013cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm. Autom Constr 30:216\u2013227","journal-title":"Autom Constr"},{"issue":"3","key":"358_CR16","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"JF Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves JF, Mendes JJM, Resende MGC (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res 189(3):1171\u20131190","journal-title":"Eur J Oper Res"},{"issue":"2","key":"358_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard M (2003) Lagrangean relaxation. Top 11(2):151\u2013200","journal-title":"Top"},{"key":"358_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.ejor.2015.05.004","volume":"246","author":"WJ Gutjahr","year":"2015","unstructured":"Gutjahr WJ (2015) Bi-objective multi-mode project scheduling under risk aversion. Eur J Oper Res 246:421\u2013434","journal-title":"Eur J Oper Res"},{"issue":"1","key":"358_CR19","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 et al (2012) A genetic algorithm for minimizing total tardiness\/earliness of weighted jobs in a batched delivery system. Comput Ind Eng 62(1):29\u201338","journal-title":"Comput Ind Eng"},{"issue":"1","key":"358_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207(1):1\u201314","journal-title":"Eur J Oper Res"},{"key":"358_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48318-9","volume-title":"Multiple attribute decision making: methods and applications","author":"C-L Hwang","year":"1981","unstructured":"Hwang C-L, Yoon K (1981) Multiple attribute decision making: methods and applications. Springer, New York"},{"key":"358_CR22","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.proeng.2015.10.087","volume":"123","author":"S Kaiafa","year":"2015","unstructured":"Kaiafa S, Chassiakos AP (2015) A genetic algorithm for optimal resource-driven project scheduling. Procedia Eng 123:260\u2013267","journal-title":"Procedia Eng"},{"key":"358_CR23","unstructured":"Kelley JE Jr, Walker M (1959) R\u2019Critical-path planning and scheduling, Papers presented at the December 1\u20133, 1959, eastern joint IRE-AIEE-ACM computer conference (ACM). pp 160\u2013173"},{"issue":"4","key":"358_CR24","first-page":"737","volume":"2","author":"M Khanzadi","year":"2011","unstructured":"Khanzadi M, Soufipour R, Rostami M (2011) A new improved genetic algorithm approach and a competitive heuristic method for large-scale multiple resource-constrained project-scheduling problems. Int J Ind Eng Comput 2(4):737\u2013748","journal-title":"Int J Ind Eng Comput"},{"issue":"1","key":"358_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Sprecher A (1997) PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. Eur J Oper Res 96(1):205\u2013216","journal-title":"Eur J Oper Res"},{"issue":"2","key":"358_CR26","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.ejor.2008.07.036","volume":"197","author":"D Kr\u00fcger","year":"2009","unstructured":"Kr\u00fcger D, Scholl A (2009) A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times. Eur J Oper Res 197(2):492\u2013508","journal-title":"Eur J Oper Res"},{"issue":"2","key":"358_CR27","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00291-008-0144-5","volume":"32","author":"D Kr\u00fcger","year":"2010","unstructured":"Kr\u00fcger D, Scholl A (2010) Managing and modelling general resource transfers in (multi-) project scheduling. OR Spectr 32(2):369\u2013394","journal-title":"OR Spectr"},{"issue":"4","key":"358_CR28","first-page":"1","volume":"19","author":"P Lamas","year":"2015","unstructured":"Lamas P, Demeulemeester E (2015) A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations. J Sched 19(4):1\u201320","journal-title":"J Sched"},{"issue":"3","key":"358_CR29","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ejor.2013.08.021","volume":"233","author":"T Messelis","year":"2014","unstructured":"Messelis T, De Causmaecker P (2014) An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. Eur J Oper Res 233(3):511\u2013528","journal-title":"Eur J Oper Res"},{"issue":"4","key":"358_CR30","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1162\/10636560152642878","volume":"9","author":"R Myers","year":"2001","unstructured":"Myers R, Hancock ER (2001) Empirical modelling of genetic algorithms. Evol Comput 9(4):461\u2013493","journal-title":"Evol Comput"},{"key":"358_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.cie.2015.02.006","volume":"83","author":"H Okubo","year":"2015","unstructured":"Okubo H et al (2015) Project scheduling under partially renewable resources and resource consumption during setup operations. Comput Ind Eng 83:91\u201399","journal-title":"Comput Ind Eng"},{"issue":"2","key":"358_CR32","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02614365","volume":"78","author":"JB Orlin","year":"1997","unstructured":"Orlin JB (1997) A polynomial time primal network simplex algorithm for minimum cost flows. Math Program 78(2):109\u2013129","journal-title":"Math Program"},{"issue":"1","key":"358_CR33","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.cie.2011.09.013","volume":"62","author":"M Ranjbar","year":"2012","unstructured":"Ranjbar M et al (2012) An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem. Comput Ind Eng 62(1):264\u2013270","journal-title":"Comput Ind Eng"},{"issue":"4","key":"358_CR34","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s001700170184","volume":"17","author":"JP Reddy","year":"2001","unstructured":"Reddy JP, Kumanan S, Chetty OK (2001) Application of petri nets and a genetic algorithm to multi-mode multi-resource constrained project scheduling. Int J Adv Manuf Technol 17(4):305\u2013314","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"358_CR35","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1007\/s12205-014-0401-x","volume":"18","author":"M Rostami","year":"2014","unstructured":"Rostami M, Moradinezhad D, Soufipour A (2014) Improved and competitive algorithms for large scale multiple resource-constrained project-scheduling problems. KSCE J Civ Eng 18(5):1261\u20131269","journal-title":"KSCE J Civ Eng"},{"issue":"16","key":"358_CR36","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(16):4909\u20134927","journal-title":"Appl Math Model"},{"issue":"1","key":"358_CR37","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0377-2217(96)00219-6","volume":"102","author":"F Salewski","year":"1997","unstructured":"Salewski F, Schirmer A, Drexl A (1997) Project scheduling under resource and mode identity constraints: model, complexity, methods, and application. Eur J Oper Res 102(1):88\u2013110","journal-title":"Eur J Oper Res"},{"key":"358_CR38","doi-asserted-by":"crossref","unstructured":"Shahsavar A, Zoraghi N, Abbasi B (2016) Integration of resource investment problem with quantity discount problem in material ordering for minimizing resource costs of projects. Oper Res 1\u201328. doi: https:\/\/doi.org\/10.1007\/s12351-016-0266-5","DOI":"10.1007\/s12351-016-0266-5"},{"issue":"2","key":"358_CR39","doi-asserted-by":"publisher","first-page":"04015028","DOI":"10.1061\/(ASCE)CP.1943-5487.0000498","volume":"30","author":"M-FF Siu","year":"2015","unstructured":"Siu M-FF, Lu M, AbouRizk S (2015) Zero-one programming approach to determine optimum resource supply under time-dependent resource constraints. J Comput Civ Eng 30(2):04015028","journal-title":"J Comput Civ Eng"},{"issue":"5","key":"358_CR40","doi-asserted-by":"publisher","first-page":"04014072","DOI":"10.1061\/(ASCE)CP.1943-5487.0000382","volume":"29","author":"R Sonmez","year":"2014","unstructured":"Sonmez R, Uysal F (2014) Backward-forward hybrid genetic algorithm for resource-constrained multiproject scheduling problem. J Comput Civ Eng 29(5):04014072","journal-title":"J Comput Civ Eng"},{"issue":"2","key":"358_CR41","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1504\/IJPS.2015.072105","volume":"2","author":"N Summerville","year":"2015","unstructured":"Summerville N, Uzsoy R, Gayt\u00e1n J (2015) A random keys genetic algorithm for a bicriterion project selection and scheduling problem. Int J Plan Sched 2(2):110\u2013133","journal-title":"Int J Plan Sched"},{"key":"358_CR42","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cie.2016.05.017","volume":"98","author":"BH Tabrizi","year":"2016","unstructured":"Tabrizi BH, Ghaderi SF (2016) A robust bi-objective model for concurrent planning of project scheduling and material procurement. Comput Ind Eng 98:11\u201329","journal-title":"Comput Ind Eng"},{"issue":"4","key":"358_CR43","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1016\/j.eswa.2013.08.081","volume":"41","author":"M Tavana","year":"2014","unstructured":"Tavana M, Abtahi A-R, Khalili-Damghani K (2014) A new multi-objective multi-mode model for solving preemptive time\u2013cost\u2013quality trade-off project scheduling problems. Expert Syst Appl 41(4):1830\u20131846","journal-title":"Expert Syst Appl"},{"key":"358_CR44","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.cie.2015.01.012","volume":"83","author":"AA Tofighian","year":"2015","unstructured":"Tofighian AA, Naderi B (2015) Modeling and solving the project selection and scheduling. Comput Ind Eng 83:30\u201338","journal-title":"Comput Ind Eng"},{"issue":"4","key":"358_CR45","doi-asserted-by":"publisher","first-page":"04015065","DOI":"10.1061\/(ASCE)CP.1943-5487.0000544","volume":"30","author":"D-H Tran","year":"2015","unstructured":"Tran D-H, Cheng M-Y, Cao M-T (2015) Solving resource-constrained project scheduling problems using hybrid artificial bee colony with differential evolution. J Comput Civ Eng 30(4):04015065","journal-title":"J Comput Civ Eng"},{"issue":"2","key":"358_CR46","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Peteghem Van","year":"2010","unstructured":"Van Peteghem V, Vanhoucke M (2010) A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. Eur J Oper Res 201(2):409\u2013418","journal-title":"Eur J Oper Res"},{"issue":"1","key":"358_CR47","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","volume":"235","author":"V Peteghem Van","year":"2014","unstructured":"Van Peteghem V, Vanhoucke M (2014) An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. Eur J Oper Res 235(1):62\u201372","journal-title":"Eur J Oper Res"},{"key":"358_CR48","doi-asserted-by":"crossref","unstructured":"Wang B, Song Y (2016) Reinvestment strategy-based project portfolio selection and scheduling with time-dependent budget limit considering time value of capital. In: Proceedings of the 2015 international conference on electrical and information technologies for rail transportation Springer, New York, pp 373\u2013381","DOI":"10.1007\/978-3-662-49370-0_39"},{"issue":"2","key":"358_CR49","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0272-6963(93)90023-I","volume":"11","author":"K-K Yang","year":"1993","unstructured":"Yang K-K, Sum C-C (1993) A comparison of resource allocation and activity scheduling rules in a dynamic multi-project environment. J Oper Manag 11(2):207\u2013218","journal-title":"J Oper Manag"},{"key":"358_CR50","volume-title":"Taguchi methods: design of experiments","author":"Y Yokoyama","year":"1993","unstructured":"Yokoyama Y (1993) Taguchi methods: design of experiments, vol 4. Amer Supplier Inst, Dearborn"},{"issue":"1","key":"358_CR51","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s12351-009-0073-3","volume":"11","author":"R Zamani","year":"2011","unstructured":"Zamani R (2011) A hybrid decomposition procedure for scheduling projects under multiple resource constraints. Oper Res Int J 11(1):93\u2013111","journal-title":"Oper Res Int J"},{"issue":"2","key":"358_CR52","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ejor.2013.03.005","volume":"229","author":"R Zamani","year":"2013","unstructured":"Zamani R (2013) A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Eur J Oper Res 229(2):552\u2013559","journal-title":"Eur J Oper Res"},{"issue":"4","key":"358_CR53","doi-asserted-by":"publisher","first-page":"3720","DOI":"10.1016\/j.asoc.2011.02.002","volume":"11","author":"K Ziarati","year":"2011","unstructured":"Ziarati K, Akbari R, Zeighami V (2011) On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput 11(4):3720\u20133733","journal-title":"Appl Soft Comput"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0358-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0358-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T09:20:06Z","timestamp":1659777606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0358-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0358-x","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,3]]},"assertion":[{"value":"8 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}