{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:04:21Z","timestamp":1780553061247,"version":"3.54.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Prod. Eng. Res. Devel."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11740-017-0716-9","type":"journal-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T11:39:32Z","timestamp":1491392372000},"page":"315-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem"],"prefix":"10.1007","volume":"11","author":[{"given":"M.","family":"Komaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Malakooti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"key":"716_CR1","doi-asserted-by":"crossref","unstructured":"Allahverdi A (2016) A survey of scheduling problems with no-wait in process. Eur J Oper Res, 255(3):665\u2013686","DOI":"10.1016\/j.ejor.2016.05.036"},{"key":"716_CR2","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/S0305-0548(02)00068-0","volume":"30","author":"T Aldowaisan","year":"2003","unstructured":"Aldowaisan T, Allahverdi A (2003) New heuristics for no-wait flow shops to minimize makespan. Comput Oper Res 30:1219\u20131231","journal-title":"Comput Oper Res"},{"issue":"10","key":"716_CR3","doi-asserted-by":"crossref","first-page":"B","DOI":"10.1287\/mnsc.16.10.B630","volume":"16","author":"HG Campbell","year":"1970","unstructured":"Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci, 16(10): B\u2013630","journal-title":"Manag Sci"},{"issue":"9","key":"716_CR4","doi-asserted-by":"crossref","first-page":"2571","DOI":"10.1080\/00207543.2012.755345","volume":"51","author":"HK Chan","year":"2013","unstructured":"Chan HK, Chung SH (2013) Optimisation approaches for distributed scheduling problems. Int J Prod Res 51(9):2571\u20132577","journal-title":"Int J Prod Res"},{"issue":"4","key":"716_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","volume":"7","author":"RF Da Silva","year":"2010","unstructured":"Da Silva RF, Urrutia S (2010) A General VNS heuristic for the traveling salesman problem with time windows. Discret Optim 7(4):203\u2013211","journal-title":"Discret Optim"},{"key":"716_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.engappai.2015.03.009","volume":"42","author":"J Armas de","year":"2015","unstructured":"de Armas J, Meli\u00e1n-Batista B, Moreno-P\u00e9rez JA, Brito J (2015) GVNS for a real-world Rich Vehicle Routing Problem with Time Windows. Eng Appl Artif Intell 42:45\u201356","journal-title":"Eng Appl Artif Intell"},{"key":"716_CR7","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Gupta JN, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604\u2013613","journal-title":"Appl Soft Comput"},{"key":"716_CR8","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.cie.2015.04.030","volume":"87","author":"X Dong","year":"2015","unstructured":"Dong X, Nowak M, Chen P, Lin Y (2015) Self-adaptive perturbation and multi-neighborhood Search for Iterated Local Search on the permutation flow shop problem. Comput Ind Eng 87:176\u2013185","journal-title":"Comput Ind Eng"},{"issue":"1","key":"716_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2007.04.004","volume":"54","author":"B Ek\u015fio\u011flu","year":"2008","unstructured":"Ek\u015fio\u011flu B, Ek\u015fio\u011flu SD, Jain P (2008) A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods. Comput Ind Eng 54(1):1\u201311","journal-title":"Comput Ind Eng"},{"issue":"4","key":"716_CR10","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 53(4):1111\u20131123","journal-title":"Int J Prod Res"},{"issue":"12","key":"716_CR11","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1057\/palgrave.jors.2601784","volume":"55","author":"JM Framinan","year":"2004","unstructured":"Framinan JM, Gupta JN, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12):1243\u20131255","journal-title":"J Oper Res Soc"},{"issue":"1","key":"716_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmatprotec.2007.07.039","volume":"197","author":"JM Framinan","year":"2008","unstructured":"Framinan JM, Nagano MS (2008) Evaluating the performance for makespan minimisation in no-wait flowshop sequencing. J Mater Process Technol 197(1):1\u20139","journal-title":"J Mater Process Technol"},{"key":"716_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0925-5273(93)90042-J","volume":"32","author":"R Gangadharan","year":"1993","unstructured":"Gangadharan R, Rajendran C (1993) Heuristic algorithms for scheduling in no-wait flow shop. Int J Product Econ 32:285\u2013290","journal-title":"Int J Product Econ"},{"issue":"3","key":"716_CR14","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641\u2013651","journal-title":"Int J Prod Res"},{"issue":"2","key":"716_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117\u2013129","journal-title":"Math Oper Res"},{"issue":"8","key":"716_CR16","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1016\/j.cor.2004.02.009","volume":"32","author":"J Grabowski","year":"2005","unstructured":"Grabowski J, Pempera J (2005) Some local search algorithms for no-wait flow-shop problem with makespan criterion. Comput Oper Res 32(8):2197\u20132212","journal-title":"Comput Oper Res"},{"issue":"3","key":"716_CR17","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"JN Gupta","year":"2006","unstructured":"Gupta JN, Stafford EF (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169(3):699\u2013711","journal-title":"Eur J Oper Res"},{"key":"716_CR18","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510\u2013525","journal-title":"Oper Res"},{"issue":"3","key":"716_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"issue":"1","key":"716_CR20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez JAM (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367\u2013407","journal-title":"Ann Oper Res"},{"issue":"3","key":"716_CR21","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen P, O\u011fuz C, Mladenovi\u0107 N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636\u2013649","journal-title":"Eur J Oper Res"},{"issue":"14","key":"716_CR22","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"SR Hejazi","year":"2005","unstructured":"Hejazi SR, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43(14):2895\u20132929","journal-title":"Int J Prod Res"},{"issue":"9\u201312","key":"716_CR23","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-010-3009-4","volume":"54","author":"B Jarboui","year":"2011","unstructured":"Jarboui B, Eddaly M, Siarry P (2011) A hybrid genetic algorithm for solving no-wait flowshop scheduling problems. The Int J Adv Manuf Technol 54(9\u201312):1129\u20131143","journal-title":"The Int J Adv Manuf Technol"},{"issue":"1","key":"716_CR24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61\u201368","journal-title":"Nav Res Logist Q"},{"key":"716_CR25","first-page":"343","volume":"18","author":"JR King","year":"1980","unstructured":"King JR, Spachis AS (1980) Heuristics for flow shop scheduling. Int J Prod Res 18:343\u2013357","journal-title":"Int J Prod Res"},{"issue":"8","key":"716_CR26","first-page":"2701","volume":"9","author":"GM Komaki","year":"2015","unstructured":"Komaki GM, Mobin S, Teymourian E, Sheikh S (2015) A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem. World Acad Sci Eng and Technol Int J Soc Behav Educ Econ Bus Ind Eng 9(8):2701\u20132708","journal-title":"World Academy of Science, Engineering and Technology, International Journal of Social, Behavioral, Educational, Economic, Business and Industrial Engineering"},{"issue":"1\u20132","key":"716_CR27","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00170-008-1454-0","volume":"41","author":"D Laha","year":"2009","unstructured":"Laha D, Chakraborty UK (2009) A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. The International Journal of Advanced Manufacturing Technology 41(1\u20132):97\u2013109","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"10","key":"716_CR28","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1057\/jors.2013.118","volume":"65","author":"D Laha","year":"2014","unstructured":"Laha D, Gupta JN, Sapkal SU (2014) A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. J Oper Res Soc 65(10):1611\u20131624","journal-title":"J Oper Res Soc"},{"issue":"9","key":"716_CR29","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1080\/00207540701737997","volume":"46","author":"X Li","year":"2008","unstructured":"Li X, Wang Q, Wu C (2008) Heuristic for no-wait flow shops with makespan minimization. Int J Prod Res 46(9):2519\u20132530","journal-title":"Int J Prod Res"},{"issue":"16","key":"716_CR30","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","volume":"51","author":"SW Lin","year":"2013","unstructured":"Lin SW, Ying KC, Huang CY (2013) Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int J Prod Res 51(16):5029\u20135038","journal-title":"Int J Prod Res"},{"key":"716_CR31","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","volume":"99","author":"SW Lin","year":"2016","unstructured":"Lin SW, Ying KC (2016) Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput Ind Eng 99:202\u2013209","journal-title":"Comput Ind Eng"},{"issue":"9\u201310","key":"716_CR32","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1007\/s00170-005-0277-5","volume":"31","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin YH (2007) An effective hybrid particle swarm optimization for no-wait flow shop scheduling. Int J Adv Manuf Technol 31(9\u201310):1001\u20131011","journal-title":"Int J Adv Manuf Technol"},{"key":"716_CR33","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.cie.2014.06.011","volume":"75","author":"R M\u2019Hallah","year":"2014","unstructured":"M\u2019Hallah R (2014) Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Comput Ind Eng 75:142\u2013156","journal-title":"Comput Ind Eng"},{"issue":"13","key":"716_CR34","doi-asserted-by":"crossref","first-page":"3802","DOI":"10.1080\/00207543.2014.899719","volume":"52","author":"R M\u2019Hallah","year":"2014","unstructured":"M\u2019Hallah R (2014) An iterated local search variable neighborhood descent hybrid heuristic for the total earliness tardiness permutation flow shop. Int J Prod Res 52(13):3802\u20133819","journal-title":"Int J Prod Res"},{"issue":"11","key":"716_CR35","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"4","key":"716_CR36","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754\u2013768","journal-title":"Comput Oper Res"},{"issue":"2","key":"716_CR37","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.ejor.2014.05.024","volume":"239","author":"B Naderi","year":"2014","unstructured":"Naderi B, Ruiz R (2014) A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur J Oper Res 239(2):323\u2013334","journal-title":"Eur J Oper Res"},{"issue":"1","key":"716_CR38","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(1):91\u201395","journal-title":"Omega"},{"issue":"1","key":"716_CR39","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160\u2013175","journal-title":"Eur J Oper Res"},{"issue":"6","key":"716_CR40","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"IH Osman","year":"1989","unstructured":"Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551\u2013557","journal-title":"Omega"},{"key":"716_CR41","doi-asserted-by":"crossref","unstructured":"Palmer D (1965) Sequencing jobs through a multi-stage process in the minimum total time\u2013a quick method of obtaining a near optimum. OR 16(1):101\u2013107","DOI":"10.2307\/3006688"},{"key":"716_CR42","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2005) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. In: Proceedings of the 24th Annual Workshop of the UK Planning and Scheduling Special Interest Group (UK PlanSIG 2005), London, UK, December 2005, pp\u00a031\u201341"},{"issue":"9","key":"716_CR43","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807\u20132839","journal-title":"Comput Oper Res"},{"issue":"7\u20138","key":"716_CR44","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","volume":"38","author":"QK Pan","year":"2008","unstructured":"Pan QK, Wang L, Zhao BH (2008) An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. Int J Adv Manuf Technol 38(7\u20138):778\u2013786","journal-title":"Int J Adv Manuf Technol"},{"key":"716_CR45","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1057\/jors.1994.65","volume":"45","author":"C Rajendran","year":"1994","unstructured":"Rajendran C (1994) A no-wait flow shop scheduling heuristic to minimize makespan. J Oper Res Soc 45:472\u2013478","journal-title":"J Oper Res Soc"},{"key":"716_CR46","doi-asserted-by":"crossref","unstructured":"Reddi SS, Ramamoorthy CV (1972) On the flow-shop sequencing problem with no wait in process. Oper Res Q 23(3):323\u2013331","DOI":"10.2307\/3007887"},{"issue":"24","key":"716_CR47","doi-asserted-by":"crossref","first-page":"7313","DOI":"10.1080\/00207543.2011.648277","volume":"50","author":"H Samarghandi","year":"2012","unstructured":"Samarghandi H, ElMekkawy TY (2012) A meta-heuristic approach for solving the no-wait flow-shop problem. Int J Prod Res 50(24):7313\u20137326","journal-title":"Int J Prod Res"},{"key":"716_CR48","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez-Oro J, Mladenovi\u0107 N, Duarte A (2014) General variable neighborhood search for computing graph separators. Optim Lett 1\u201321. doi:\n10.1007\/s11590-014-0793-z","DOI":"10.1007\/s11590-014-0793-z"},{"key":"716_CR49","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0167-6377(03)00005-1","volume":"31","author":"CJ Schuster","year":"2003","unstructured":"Schuster CJ, Framinan JM (2003) Approximative procedure for no-wait job shop scheduling. Oper Res Lett 31:308\u2013318","journal-title":"Oper Res Lett"},{"key":"716_CR50","doi-asserted-by":"crossref","DOI":"10.1201\/9780203910405","volume-title":"Logistics of facility location and allocation","author":"DR Sule","year":"2001","unstructured":"Sule DR (2001) Logistics of facility location and allocation. Marcel Dekker Inc, New York, NY"},{"issue":"2","key":"716_CR51","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"key":"716_CR52","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Buyukdagli O, Pan QK, Suganthan PN (2013) A general variable neighborhood search algorithm for the no-idle permutation flowshop scheduling problem. In: Swarm, evolutionary, and memetic computing. Springer International Publishing, pp.\u00a024\u201334","DOI":"10.1007\/978-3-319-03753-0_3"},{"key":"716_CR53","doi-asserted-by":"publisher","unstructured":"Todosijevi\u0107 R, Mjirda A, Mladenovi\u0107 M, Hanafi S, Gendron B (2014) A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optim Lett 1\u201310. doi:\n10.1007\/s11590-014-0788-9","DOI":"10.1007\/s11590-014-0788-9"},{"issue":"1","key":"716_CR54","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ijpe.2010.06.006","volume":"128","author":"LY Tseng","year":"2010","unstructured":"Tseng LY, Lin YT (2010) A hybrid genetic algorithm for no-wait flowshop scheduling problem. Int J Prod Econ 128(1):144\u2013152","journal-title":"Int J Prod Econ"},{"issue":"1","key":"716_CR55","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","volume":"145","author":"SY Wang","year":"2013","unstructured":"Wang SY, Wang L, Liu M, Xu Y (2013) An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int J Product Econ 145(1):387\u2013396","journal-title":"Int J Product Econ"},{"issue":"3","key":"716_CR56","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1287\/opre.20.3.689","volume":"20","author":"D Wismer","year":"1972","unstructured":"Wismer D (1972) Solution of the flowshop-scheduling problem with no intermediate queues. Oper Res 20(3):689\u2013697","journal-title":"Oper Res"},{"issue":"9","key":"716_CR57","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1080\/0305215X.2013.827673","volume":"46","author":"Y Xu","year":"2014","unstructured":"Xu Y, Wang L, Wang S, Liu M (2014) An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Eng Optim 46(9):1269\u20131283","journal-title":"Eng Optim"}],"container-title":["Production Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-017-0716-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11740-017-0716-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11740-017-0716-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,15]],"date-time":"2017-05-15T09:38:26Z","timestamp":1494841106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11740-017-0716-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s11740-017-0716-9","relation":{},"ISSN":["0944-6524","1863-7353"],"issn-type":[{"value":"0944-6524","type":"print"},{"value":"1863-7353","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,4]]}}}