{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:59:49Z","timestamp":1760709589815},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T00:00:00Z","timestamp":1524009600000},"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":["Appl Intell"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10489-018-1160-z","type":"journal-article","created":{"date-parts":[[2018,4,18]],"date-time":"2018-04-18T05:34:28Z","timestamp":1524029668000},"page":"3707-3734","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility"],"prefix":"10.1007","volume":"48","author":[{"given":"Ricardo","family":"P\u00e9rez-Rodr\u00edguez","sequence":"first","affiliation":[]},{"given":"Arturo","family":"Hern\u00e1ndez-Aguirre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"issue":"3","key":"1160_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391\u2013401","journal-title":"Manag Sci"},{"issue":"1","key":"1160_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali A, Meil\u0103 M (2012) Experiments with Kemeny ranking: what works when?. Math Soc Sci 64(1):28\u201340","journal-title":"Math Soc Sci"},{"issue":"2","key":"1160_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149\u2013156","journal-title":"ORSA J Comput"},{"key":"1160_CR4","unstructured":"Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09"},{"issue":"2","key":"1160_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6(2):157\u2013165","journal-title":"Soc Choice Welf"},{"key":"1160_CR6","volume-title":"M\u00e9moire sur les \u00e9lections au scrutin, vol 1781","author":"JD Borda","year":"1784","unstructured":"Borda JD (1784) M\u00e9moire sur les \u00e9lections au scrutin, vol 1781. Histoire de l\u2019Academie Royale des Sciences pour, Paris"},{"issue":"3","key":"1160_CR7","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. Ann Oper Res 41 (3):157\u2013183","journal-title":"Ann Oper Res"},{"issue":"2","key":"1160_CR8","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2014","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano JA (2014) A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans Evol Comput 18(2):286\u2013300","journal-title":"IEEE Trans Evol Comput"},{"key":"1160_CR9","unstructured":"Chambers JB, Barnes JW (1996) New tabu search results for the job shop scheduling problem. The University of Texas, Austin, Technical Report Series ORP96-06, Graduate Program in Operations Research and Industrial Engineering"},{"issue":"7","key":"1160_CR10","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1016\/j.cor.2011.08.016","volume":"39","author":"SH Chen","year":"2012","unstructured":"Chen SH, Chang PC, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39(7):1450\u20131457","journal-title":"Comput Oper Res"},{"issue":"9","key":"1160_CR11","doi-asserted-by":"publisher","first-page":"6441","DOI":"10.1016\/j.eswa.2010.02.073","volume":"37","author":"SH Chen","year":"2010","unstructured":"Chen SH, Chen MC, Chang PC, Zhang Q, Chen YM (2010) Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Syst Appl 37(9):6441\u20136451","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1160_CR12","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.cie.2011.11.002","volume":"62","author":"YM Chen","year":"2012","unstructured":"Chen YM, Chen MC, Chang PC, Chen SH (2012) Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems. Comput Ind Eng 62(2):536\u2013545","journal-title":"Comput Ind Eng"},{"key":"1160_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1613\/jair.587","volume":"10","author":"WW Cohen","year":"1998","unstructured":"Cohen WW, Schapire RE, Singer Y (1998) Learning to order things. J Artif Intell Res 10:243\u2013270","journal-title":"J Artif Intell Res"},{"key":"1160_CR14","doi-asserted-by":"publisher","unstructured":"Dauod H, Li D, Yoon SW, Srihari K (2016) Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems. Int J Adv Manuf Technol:1\u201311, \n                    https:\/\/doi.org\/10.1007\/s00170-016-9123-1","DOI":"10.1007\/s00170-016-9123-1"},{"issue":"2","key":"1160_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1160_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331","journal-title":"J Intell Manuf"},{"key":"1160_CR17","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial Scheduling. Prentice Hall, Englewood Cliffs, pp 225\u2013251"},{"key":"1160_CR18","doi-asserted-by":"crossref","unstructured":"Fligner MA, Verducci JS (1986) Distance based ranking models. J R Stat Soc Ser B Methodol 48(3):359\u2013369. \n                    http:\/\/www.jstor.org\/stable\/2345433","DOI":"10.1111\/j.2517-6161.1986.tb01420.x"},{"issue":"403","key":"1160_CR19","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1080\/01621459.1988.10478679","volume":"83","author":"MA Fligner","year":"1988","unstructured":"Fligner MA, Verducci JS (1988) Multistage ranking models. J Amer Stat Assoc 83(403):892\u2013901","journal-title":"J Amer Stat Assoc"},{"issue":"9","key":"1160_CR20","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892\u20132907","journal-title":"Comput Oper Res"},{"key":"1160_CR21","doi-asserted-by":"crossref","unstructured":"Gen M, Tsujimura Y, Kubota E (1994) Solving job-shop scheduling problems by genetic algorithm. In: 1994 IEEE International Conference on Systems, Man, and Cybernetics, 1994. Humans, Information and Technology, vol 2. IEEE, pp 1577\u20131582","DOI":"10.1109\/ICSMC.1994.400072"},{"key":"1160_CR22","doi-asserted-by":"crossref","unstructured":"Greenwood AG, Vanguri S, Eksioglu B, Jain P, Hill TW, Miller JW, Walden CT (2005) Simulation optimization decision support system for ship panel shop operations. In: Proceedings of the 37th conference on Winter simulation. Winter Simulation Conference, pp 2078\u20132086","DOI":"10.1109\/WSC.2005.1574490"},{"issue":"1","key":"1160_CR23","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1186\/s40064-016-3054-z","volume":"5","author":"S Huang","year":"2016","unstructured":"Huang S, Tian N, Wang Y, Ji Z (2016) Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus 5(1):1432","journal-title":"SpringerPlus"},{"key":"1160_CR24","doi-asserted-by":"publisher","unstructured":"Irurozki E, Calvo B, Lozano JA (2014) Sampling and learning Mallows and Generalized Mallows models under the Cayley distance. Methodol Comput Appl Probab 20(1):1\u201335. \n                    https:\/\/doi.org\/10.1007\/s11009-016-9506-7","DOI":"10.1007\/s11009-016-9506-7"},{"issue":"9","key":"1160_CR25","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1016\/j.cor.2008.11.004","volume":"36","author":"B Jarboui","year":"2009","unstructured":"Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Oper Res 36(9):2638\u20132646","journal-title":"Comput Oper Res"},{"issue":"3","key":"1160_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0378-4754(02)00019-8","volume":"60","author":"I Kacem","year":"2002","unstructured":"Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3):245\u2013276","journal-title":"Math Comput Simul"},{"key":"1160_CR27","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol 1000, p IV","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"8","key":"1160_CR28","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/S0305-0548(02)00063-1","volume":"30","author":"YK Kim","year":"2003","unstructured":"Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30(8):1151\u20131171","journal-title":"Comput Oper Res"},{"key":"1160_CR29","volume-title":"Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2","year":"2001","unstructured":"Larra\u00f1aga P, Lozano JA (eds) (2001) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer Science and Business Media, Berlin"},{"key":"1160_CR30","volume-title":"Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration","author":"S Lawrence","year":"1984","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh"},{"issue":"1","key":"1160_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0360-8352(02)00079-7","volume":"43","author":"YH Lee","year":"2002","unstructured":"Lee YH, Jeong CS, Moon C (2002) Advanced planning and scheduling with outsourcing in manufacturing supply chain. Comput Ind Eng 43(1):351\u2013374","journal-title":"Comput Ind Eng"},{"key":"1160_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93\u2013110","journal-title":"Int J Prod Econ"},{"key":"1160_CR33","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.cie.2016.12.008","volume":"104","author":"X Li","year":"2017","unstructured":"Li X, Xing K, Wu Y, Wang X, Luo J (2017) Total energy consumption optimization via genetic algorithm in flexible manufacturing systems. Comput Ind Eng 104:188\u2013200","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1160_CR34","doi-asserted-by":"publisher","first-page":"4348","DOI":"10.1016\/j.eswa.2010.09.104","volume":"38","author":"H Liu","year":"2011","unstructured":"Liu H, Gao L, Pan Q (2011) A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Syst Appl 38(4):4348\u20134360","journal-title":"Expert Syst Appl"},{"issue":"1\/2","key":"1160_CR35","doi-asserted-by":"publisher","first-page":"114","DOI":"10.2307\/2333244","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows CL (1957) Non-null ranking models. I. Biometrika 44(1\/2):114\u2013130","journal-title":"I. Biometrika"},{"key":"1160_CR36","unstructured":"Meil\u0103 M, Phadnis K, Patterson A, Bilmes J (2012) Consensus ranking under the exponential model. arXiv:\n                    1206.5265"},{"key":"1160_CR37","unstructured":"Meil\u0103 M, Phadnis K, Patterson A, Bilmes J (2007) Consensus ranking under the exponential model. In: Proceedings of the 22nd Conference Uncertainty and Artificial Intelligence, Vancouver, pp 285\u2013294"},{"issue":"3","key":"1160_CR38","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H M\u00fchlenbein","year":"1997","unstructured":"M\u00fchlenbein H (1997) The equation for response to selection and its use for prediction. Evol Comput 5(3):303\u2013346","journal-title":"Evol Comput"},{"key":"1160_CR39","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein H, Paa\u00df G (1996) From recombination of genes to the estimation of distributions. I binary parameters. In: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature. Springer, Berlin, p 187","DOI":"10.1007\/3-540-61723-X_982"},{"issue":"6","key":"1160_CR40","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven C, \u00d6zbakr L, Yavuz Y (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl Math Modell 34(6):1539\u20131548","journal-title":"Appl Math Modell"},{"issue":"2","key":"1160_CR41","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.apm.2011.07.037","volume":"36","author":"C \u00d6zg\u00fcven","year":"2012","unstructured":"\u00d6zg\u00fcven C, Yavuz Y, \u00d6zbakr L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl Math Modell 36(2):846\u2013858","journal-title":"Appl Math Modell"},{"issue":"2","key":"1160_CR42","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.omega.2011.05.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Ruiz R (2012) An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40(2):166\u2013180","journal-title":"Omega"},{"key":"1160_CR43","doi-asserted-by":"crossref","unstructured":"Park BJ, Choi HR (2006) A genetic algorithm for integration of process planning and scheduling in a job shop. In: Australian conference on artificial intelligence, pp 647\u2013657","DOI":"10.1007\/11941439_69"},{"key":"1160_CR44","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a JM, Robles V, Larranaga P, Herves V, Rosales F, P\u00e9rez MS (2004) GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer, Berlin, pp 361\u2013371","DOI":"10.1007\/978-3-540-24677-0_38"},{"issue":"3","key":"1160_CR45","doi-asserted-by":"publisher","first-page":"1948","DOI":"10.1016\/j.ifacol.2015.06.373","volume":"48","author":"RK Phanden","year":"2015","unstructured":"Phanden RK, Jain A (2015) Assessment of makespan performance for flexible process plans in job shop scheduling. IFAC-PapersOnLine 48(3):1948\u20131953","journal-title":"IFAC-PapersOnLine"},{"issue":"5","key":"1160_CR46","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","volume":"23","author":"A Rossi","year":"2007","unstructured":"Rossi A, Dini G (2007) Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot Comput-Integr Manuf 23(5):503\u2013516","journal-title":"Robot Comput-Integr Manuf"},{"issue":"3","key":"1160_CR47","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"issue":"10","key":"1160_CR48","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495\u20131509","journal-title":"Manag Sci"},{"key":"1160_CR49","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0360-8352(88)90102-7","volume":"15","author":"RM Sundaram","year":"1988","unstructured":"Sundaram RM, Fu SS (1988) Process planning and scheduling. Comput Ind Eng 15:296\u2013307","journal-title":"Comput Ind Eng"},{"key":"1160_CR50","volume-title":"Integration of process planning and scheduling-a mathematical programming approach","author":"W Tan","year":"1998","unstructured":"Tan W (1998) Integration of process planning and scheduling-a mathematical programming approach. University of Southern California, USA"},{"issue":"4","key":"1160_CR51","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/j.cie.2011.12.014","volume":"62","author":"L Wang","year":"2012","unstructured":"Wang L, Wang S, Xu Y, Zhou G, Liu M (2012) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62(4):917\u2013926","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1160_CR52","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1057\/jors.2015.50","volume":"67","author":"K Wang","year":"2016","unstructured":"Wang K, Huang Y, Qin H (2016) A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown. J Oper Res Soc 67(1):68\u201382","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1160_CR53","first-page":"5","volume":"12","author":"H Xu","year":"2017","unstructured":"Xu H, Bao ZR, Zhang T (2017) Solving dual flexible job-shop scheduling problem using a Bat Algorithm. Adv Prod Eng Manag 12(1):5","journal-title":"Adv Prod Eng Manag"},{"key":"1160_CR54","unstructured":"Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job-shop problems. In: PPSN, vol 2, pp 281\u2013290"},{"key":"1160_CR55","first-page":"15","volume":"13","author":"L Yin","year":"2017","unstructured":"Yin L, Li X, Gao L, Lu C, Zhang Z (2017) A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustain Comput: Inform Syst 13:15\u201330","journal-title":"Sustain Comput: Inform Syst"},{"issue":"1","key":"1160_CR56","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1186\/s40064-016-3265-3","volume":"5","author":"L Yue","year":"2016","unstructured":"Yue L, Guan Z, Saif U, Zhang F, Wang H (2016) Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects. SpringerPlus 5(1):1593","journal-title":"SpringerPlus"},{"key":"1160_CR57","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1160-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1160-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1160-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T23:16:50Z","timestamp":1555543010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1160-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,18]]},"references-count":57,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1160"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1160-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,18]]},"assertion":[{"value":"18 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}