{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T01:01:14Z","timestamp":1770512474532,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,1,24]],"date-time":"2015-01-24T00:00:00Z","timestamp":1422057600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s00500-015-1590-z","type":"journal-article","created":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T19:33:04Z","timestamp":1422041584000},"page":"1329-1339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Chin-Chia","family":"Wu","sequence":"first","affiliation":[]},{"given":"Yunqiang","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Wen-Hsiang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Hung-Ming","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shuenn-Ren","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,24]]},"reference":[{"key":"1590_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1057\/palgrave.jors.2601689","volume":"55","author":"A Bachman","year":"2004","unstructured":"Bachman A, Janiak A (2004) Scheduling jobs with position-dependent processing times. J Oper Res Soc 55:257\u2013264","journal-title":"J Oper Res Soc"},{"key":"1590_CR2","first-page":"58","volume":"15","author":"D Beasley","year":"1993","unstructured":"Beasley D, Bull D, Martin RR (1993) An overview of genetic algorithms, part 1: fundamentals. J Univ Comput 15:58\u201369","journal-title":"J Univ Comput"},{"key":"1590_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"issue":"4","key":"1590_CR4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1504\/EJIE.2010.035652","volume":"4","author":"W Besbes","year":"2010","unstructured":"Besbes W, Teghem J, Loukil T (2010) Scheduling hybrid flow shop problem with non-fixed availability constraint. Eur J Ind Eng 4(4):413\u2013433","journal-title":"Eur J Ind Eng"},{"key":"1590_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"key":"1590_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup D (2008) A state-of-the-art review on scheduling with learning effect. Eur J Oper Res 188:315\u2013329","journal-title":"Eur J Oper Res"},{"key":"1590_CR7","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques 3:415\u2013420","journal-title":"Technique et Science Informatiques"},{"key":"1590_CR8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.cie.2005.09.001","volume":"49","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (2005) A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Comput Ind Eng 49:611\u2013624","journal-title":"Comput Ind Eng"},{"key":"1590_CR9","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.cor.2006.03.021","volume":"35","author":"J Blazewicz","year":"2008","unstructured":"Blazewicz J, Pesch E, Sterna M, Werner F (2008) Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Comput Oper Res 35:574\u2013599","journal-title":"Comput Oper Res"},{"key":"1590_CR10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0360-8352(02)00123-7","volume":"43","author":"Kethley R Bryan","year":"2002","unstructured":"Bryan Kethley R, Alidaee B (2002) Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms. Comput Ind Eng 43:509\u2013528","journal-title":"Comput Ind Eng"},{"key":"1590_CR11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"CL Chen","year":"1995","unstructured":"Chen CL, Vempati VS, Aljaber N (1995) An application of genetic algorithms for flow shop problems. Eur J Oper Res 80:389\u2013396","journal-title":"Eur J Oper Res"},{"key":"1590_CR12","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.eswa.2006.09.021","volume":"34","author":"JS Chen","year":"2008","unstructured":"Chen JS, Pan JCH, Lin CM (2008) A hybrid genetic algorithm for the reentrant flow-shop scheduling problem. Expert Syst Appl 34:570\u2013577","journal-title":"Expert Syst Appl"},{"key":"1590_CR13","doi-asserted-by":"crossref","unstructured":"Chen Z-Y, Tsai C-F, Eberle W, Lin W-C, Ke S-W (2014) Instance selection by genetic-based biological algorithm. Soft Comput. doi: 10.1007\/s00500-014-1339-0","DOI":"10.1007\/s00500-014-1339-0"},{"key":"1590_CR14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1019216726076","volume":"98","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Wang G (2000) Single machine scheduling with learning effect considerations. Ann Oper Res 98:273\u2013290","journal-title":"Ann Oper Res"},{"key":"1590_CR15","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cie.2010.12.008","volume":"60","author":"TCE Cheng","year":"2011","unstructured":"Cheng TCE, Cheng S-R, Wu W-H, Hsu P-H, Wu C-C (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing- times-based learning considerations. Comput Ind Eng 60:534\u2013541","journal-title":"Comput Ind Eng"},{"key":"1590_CR16","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Matib Y, Dauzere-Peres S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35:2599\u20132616","journal-title":"Comput Oper Res"},{"issue":"8","key":"1590_CR17","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1057\/palgrave.jors.2601766","volume":"55","author":"O Etiler","year":"2004","unstructured":"Etiler O, Toklu B, Atak M, Wilson J (2004) A genetic algorithm for flow shop scheduling problems. J Oper Res Soc 55(8):830\u2013835","journal-title":"J Oper Res Soc"},{"key":"1590_CR18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","volume":"11","author":"ML Fisher","year":"1971","unstructured":"Fisher ML (1971) A dual algorithm for the one-machine scheduling problem. Math Progr 11:229\u2013251","journal-title":"Math Progr"},{"key":"1590_CR19","volume-title":"Sequencing and scheduling: an introduction to the mathematics of the job-shop","author":"S French","year":"1982","unstructured":"French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job-shop. Ellis Horwood Ltd., Chichester"},{"key":"1590_CR20","doi-asserted-by":"crossref","unstructured":"Falkenauer E, Bouffoix S (1991) A genetic algorithm for job shop. In: Proceedings of the 1991 IEEE international conference on robotics and automation","DOI":"10.1109\/ROBOT.1991.131689"},{"key":"1590_CR21","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0305-0548(03)00016-9","volume":"31","author":"SK Iyer","year":"2004","unstructured":"Iyer SK, Saxena BS (2004) Improved genetic algorithm for the permutation flowshop scheduling problem. Comput Oper Res 31:593\u2013606","journal-title":"Comput Oper Res"},{"issue":"3\u20134","key":"1590_CR22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2009.09.004","volume":"38","author":"A Janiak","year":"2010","unstructured":"Janiak A, Rudek R (2010) A note on a makespan minimization problem with a multi-ability learning effect. Omega 38(3\u20134):213\u2013217","journal-title":"Omega"},{"key":"1590_CR23","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1007\/s00500-012-0976-4","volume":"17","author":"P Karthikeyan","year":"2013","unstructured":"Karthikeyan P, Baskar S, Alphones A (2013) Improved genetic algorithm using different genetic operator combinations (GOCs) for multicast routing in ad hoc networks. Soft Comput 17:1563\u20131572","journal-title":"Soft Comput"},{"key":"1590_CR24","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","volume":"178","author":"C Koulamas","year":"2007","unstructured":"Koulamas C, Kyparisis GJ (2007) Single-machine and two-machine flowshop scheduling with general learning functions. Eur J Oper Res 178:402\u2013407","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1590_CR25","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","volume":"174","author":"WH Kuo","year":"2006","unstructured":"Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time- dependent learning effect. Eur J Oper Res 174(2):1184\u20131190","journal-title":"Eur J Oper Res"},{"key":"1590_CR26","doi-asserted-by":"crossref","unstructured":"Li J, Song Y (2013) Community detection in complex networks using extended compact genetic algorithm. Soft Comput. doi: 10.1007\/s00500-012-0942-1","DOI":"10.1007\/s00500-012-0942-1"},{"issue":"3","key":"1590_CR27","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1504\/EJIE.2010.033331","volume":"4","author":"A Manaa","year":"2010","unstructured":"Manaa A, Chu C (2010) Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors. Eur J Ind Eng 4(3):265\u2013279","journal-title":"Eur J Ind Eng"},{"key":"1590_CR28","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore JM (1968) An n-job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15:102\u2013109","journal-title":"Manag Sci"},{"key":"1590_CR29","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/S0377-2217(99)00432-4","volume":"130","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001) Scheduling problem with a learning effect. Eur J Oper Res 130:638\u2013652","journal-title":"Eur J Oper Res"},{"key":"1590_CR30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91\u201395","journal-title":"Omega"},{"key":"1590_CR31","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.cie.2009.05.011","volume":"57","author":"E Pesch","year":"2009","unstructured":"Pesch E, Sterna M (2009) Late work minimization in flow shops by a genetic algorithm. Comput Ind Eng 57:1202\u20131209","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1590_CR32","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts CN, Van Wassenhove LN (1992) Single machine scheduling to minimize total late work. Oper Res 40(3):586\u2013595","journal-title":"Oper Res"},{"key":"1590_CR33","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.cie.2006.12.004","volume":"52","author":"M Sterna","year":"2007","unstructured":"Sterna M (2007a) Late work minimization in a small flexible manufacturing system. Comput Ind Eng 52:210\u2013228","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1590_CR34","first-page":"59","volume":"55","author":"M Sterna","year":"2007","unstructured":"Sterna M (2007b) Dominance relations for two-machine flow shop problem with late work criterion. Bull Pol Acad Sci Tech Sci 55(1):59\u201369","journal-title":"Bull Pol Acad Sci Tech Sci"},{"key":"1590_CR35","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120\u2013129","journal-title":"Omega"},{"key":"1590_CR36","unstructured":"Sterna M, Blazewicz J (2007) Genetic algorithm for late work minimization in a flow shop system. MISTA, pp 455\u2013462"},{"key":"1590_CR37","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.mcm.2009.05.026","volume":"50","author":"MD Toksari","year":"2009","unstructured":"Toksari MD, Oron D, G\u00fcner E (2009) Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning. Math Comput Model 50:401\u2013406","journal-title":"Math Comput Model"},{"key":"1590_CR38","doi-asserted-by":"crossref","unstructured":"Wang JB (2010) Single-machine scheduling with a sum-of-actual-processing-time-based learning effect. J Oper Res Soc 61:172\u2013177","DOI":"10.1057\/jors.2008.146"},{"key":"1590_CR39","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1007\/s00170-009-2477-x","volume":"49","author":"J-B Wang","year":"2010","unstructured":"Wang J-B, Sun L-H, Sun L-Y (2010a) Single machine scheduling with a learning effect and discounted costs. Int J Adv Manuf Technol 49:1141\u20131149","journal-title":"Int J Adv Manuf Technol"},{"key":"1590_CR40","doi-asserted-by":"crossref","first-page":"2673","DOI":"10.1016\/j.camwa.2010.09.005","volume":"60","author":"J-B Wang","year":"2010","unstructured":"Wang J-B, Sun L-H, Sun L-Y (2010b) Scheduling jobs with an exponential sum-of-actual-processing-time based learning effect. Comput Math Appl 60:2673\u20132678","journal-title":"Comput Math Appl"},{"key":"1590_CR41","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1016\/j.camwa.2010.09.061","volume":"60","author":"J-B Wang","year":"2010","unstructured":"Wang J-B, Wang M-Z (2010) Single machine multiple common due dates scheduling with learning effects. Comput Math Appl 60:2998\u20133002","journal-title":"Comput Math Appl"},{"key":"1590_CR42","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1016\/j.apm.2010.09.017","volume":"35","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Li J-X (2011) Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects. Appl Math Model 35:1388\u20131395","journal-title":"Appl Math Model"},{"key":"1590_CR43","doi-asserted-by":"crossref","first-page":"4017","DOI":"10.1016\/j.apm.2011.02.023","volume":"35","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Wang C (2011a) Single-machine due-window assignment problem with learning effect and deteriorating jobs. Appl Math Model 35:4017\u20134022","journal-title":"Appl Math Model"},{"key":"1590_CR44","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.apm.2009.04.020","volume":"34","author":"J-B Wang","year":"2010","unstructured":"Wang J-B, Guo Q (2010) A due-date assignment problem with learning effect and deteriorating jobs. Appl Math Model 34:309\u2013313","journal-title":"Appl Math Model"},{"key":"1590_CR45","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10479-011-0923-2","volume":"191","author":"J-B Wang","year":"2011","unstructured":"Wang J-B, Wang M-Z (2011b) Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. Ann Oper Res 191:155\u2013169","journal-title":"Ann Oper Res"},{"issue":"5","key":"1590_CR46","doi-asserted-by":"crossref","first-page":"1250030","DOI":"10.1142\/S0217595912500303","volume":"29","author":"J-B Wang","year":"2012","unstructured":"Wang J-B, Wang M-Z, Ji P (2012) Scheduling jobs with processing times dependent on position, starting time and allotted resource. Asia Pac J Oper Res 29(5):1250030 (p 15 )","journal-title":"Asia Pac J Oper Res"},{"key":"1590_CR47","doi-asserted-by":"crossref","first-page":"2364","DOI":"10.1016\/j.apm.2012.05.029","volume":"37","author":"J-B Wang","year":"2013","unstructured":"Wang J-B, Wang J-J (2013) Scheduling jobs with a general learning effect model. Appl Math Model 37:2364\u20132373","journal-title":"Appl Math Model"},{"key":"1590_CR48","doi-asserted-by":"crossref","first-page":"8394","DOI":"10.1016\/j.apm.2013.03.041","volume":"37","author":"J-B Wang","year":"2013","unstructured":"Wang J-B, Liu L, Wang C (2013a) Single machine SLK\/DIF due window assignment problem with learning effect and deteriorating jobs. Appl Math Model 37:8394\u20138400","journal-title":"Appl Math Model"},{"key":"1590_CR49","doi-asserted-by":"crossref","first-page":"2906","DOI":"10.1016\/j.cor.2013.07.001","volume":"40","author":"X-Y Wang","year":"2013","unstructured":"Wang X-Y, Zhou Z, Zhang X, Ji P, Wang J-B (2013b) Several flow shop scheduling problems with truncated position-based learning effect. Comput Oper Res 40:2906\u20132929","journal-title":"Comput Oper Res"},{"key":"1590_CR50","doi-asserted-by":"crossref","first-page":"122","DOI":"10.2514\/8.155","volume":"3","author":"TP Wright","year":"1936","unstructured":"Wright TP (1936) Factors affecting the cost of airplanes. J Aeronaut Sci 3:122\u2013128","journal-title":"J Aeronaut Sci"},{"key":"1590_CR51","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/j.cor.2010.11.001","volume":"38","author":"C-C Wu","year":"2011","unstructured":"Wu C-C, Hsu P-H, Chen J-C, Wang N-S (2011) Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times. Comput Oper Res 38:1025\u20131034","journal-title":"Comput Oper Res"},{"issue":"5","key":"1590_CR52","first-page":"372","volume":"27","author":"SJ Yang","year":"2010","unstructured":"Yang SJ, Hsu CJ, Yang DL (2010) Parallel-machine scheduling with setup and removal times under consideration of the learning effect. J Chin Inst Ind Eng 27(5):372\u2013378","journal-title":"J Chin Inst Ind Eng"},{"key":"1590_CR53","doi-asserted-by":"crossref","first-page":"2068","DOI":"10.1016\/j.apm.2010.11.041","volume":"35","author":"S-J Yang","year":"2011","unstructured":"Yang S-J, Yang D-L (2011) Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption. Appl Math Model 35:2068\u20132074","journal-title":"Appl Math Model"},{"key":"1590_CR54","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1057\/jors.2011.155","volume":"63","author":"S-J Yang","year":"2012","unstructured":"Yang S-J, Yang D-L (2012) Scheduling problems with past-sequence-dependent delivery times and learning effects. J Oper Res Soc 63:1508\u20131515","journal-title":"J Oper Res Soc"},{"key":"1590_CR55","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s00170-010-2973-z","volume":"54","author":"N Yin","year":"2011","unstructured":"Yin N, Wang X-Y (2011) Single machine scheduling with controllable processing times and learning effect. Int J Adv Manuf Technol 54:743\u2013748","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"1590_CR56","doi-asserted-by":"crossref","first-page":"3623","DOI":"10.1016\/j.apm.2010.03.011","volume":"34","author":"Y Yin","year":"2010","unstructured":"Yin Y, Xu D, Wang J (2010) Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect. Appl Math Model 34(11):3623\u20133630","journal-title":"Appl Math Model"},{"issue":"1","key":"1590_CR57","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1504\/EJIE.2011.037224","volume":"5","author":"K-C Ying","year":"2011","unstructured":"Ying K-C, Lin S-W, Lu C-C (2011) Cell formation using a simulated annealing algorithm with variable neighbourhood. Eur J Ind Eng 5(1):22\u201342","journal-title":"Eur J Ind Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1590-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1590-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1590-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:43:45Z","timestamp":1559094225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1590-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,24]]},"references-count":57,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1590"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1590-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,24]]}}}