{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:52:23Z","timestamp":1766181143749,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T00:00:00Z","timestamp":1535414400000},"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":[[2019,9]]},"DOI":"10.1007\/s00500-018-3466-5","type":"journal-article","created":{"date-parts":[[2018,8,28]],"date-time":"2018-08-28T06:27:51Z","timestamp":1535437671000},"page":"8677-8688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Artificial bee colony algorithms for the order scheduling with release dates"],"prefix":"10.1007","volume":"23","author":[{"given":"Win-Chin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Jianyou","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Danyu","family":"Bai","sequence":"additional","affiliation":[]},{"given":"I-Hong","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Shang-Chia","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1598-5127","authenticated-orcid":false,"given":"Chin-Chia","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,28]]},"reference":[{"key":"3466_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jnca.2016.04.020","volume":"69","author":"AA Abba Ari","year":"2016","unstructured":"Abba Ari AA, Yenke BO, Labraoui N, Damakoa I, Gueroui A (2016) A power efficient cluster-based routing algorithm for wireless sensor networks: honeybees swarm intelligence based approach. J Netw Comput Appl 69:77\u201397","journal-title":"J Netw Comput Appl"},{"key":"3466_CR2","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/nav.20092","volume":"52","author":"R Ahmadi","year":"2005","unstructured":"Ahmadi R, Bagchi U, Roemer TA (2005) Coordinated scheduling of customer orders for quick response. Naval Res Logist 52:493\u2013512","journal-title":"Naval Res Logist"},{"key":"3466_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"VA Armentano","year":"1999","unstructured":"Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26:219\u2013235","journal-title":"Comput Oper Res"},{"key":"3466_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.advengsoft.2015.10.013","volume":"92","author":"I Aydo\u011fdu","year":"2016","unstructured":"Aydo\u011fdu I, Ak\u0131n A, Saka MP (2016) Design optimization of real world steel space frames using artificial bee colony algorithm with Levy flight distribution. Adv Eng Softw 92:1\u201314","journal-title":"Adv Eng Softw"},{"key":"3466_CR5","unstructured":"Basturk B, Karaboga D (2006) An artificial bee colony (ABC) algorithm for numeric function optimization. In: IEEE swarm intelligence symposium 2006, May 12\u201314, Indianapolis, IN, USA"},{"key":"3466_CR6","unstructured":"Benatchba K, Admane L, Koud\u0131l\u00a0M (2005) Using bees to solve data-mining problem expressed as a max-sat one, artificial intelligence and knowledge engineering applications: a bioinspired approach. In: First international work-conference on the interplay between natural and artificial computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15\u201318"},{"issue":"4","key":"3466_CR7","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1111\/j.1540-5915.1998.tb00883.x","volume":"29","author":"JD Blocher","year":"1998","unstructured":"Blocher JD, Chhajed D, Leung M (1998) Customer order scheduling in a general job shop environment. Decis Sci 29(4):951\u2013981","journal-title":"Decis Sci"},{"issue":"1","key":"3466_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s12351-016-0225-1","volume":"17","author":"SN Chaurasia","year":"2016","unstructured":"Chaurasia SN, Sundar S, Singh A (2016) Hybrid metaheuristic approaches for the single machine total stepwise tardiness problem with release date. Oper Res Int J 17(1):275\u2013295","journal-title":"Oper Res Int J"},{"issue":"8","key":"3466_CR9","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1007\/s00500-015-1908-x","volume":"21","author":"S-R Cheng","year":"2017","unstructured":"Cheng S-R, Yin Y, Wen C-H, Lin W-C, Wu C-C, Liu J (2017) A two-machine flowshop scheduling problem with precedence constraint on two jobs. Soft Comput 21(8):2091\u20132103","journal-title":"Soft Comput"},{"key":"3466_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.amc.2006.06.086","volume":"185","author":"E Erel","year":"2007","unstructured":"Erel E, Ghosh JB (2007) Customer order scheduling on a single machine with family setup times: complexity and algorithms. Appl Math Comput 185:11\u201318","journal-title":"Appl Math Comput"},{"key":"3466_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.cor.2016.09.010","volume":"78","author":"JM Framinan","year":"2017","unstructured":"Framinan JM, Perez-Gonzalez P (2017) New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput Oper Res 78:181\u2013192","journal-title":"Comput Oper Res"},{"key":"3466_CR12","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 Limited, Chichester"},{"key":"3466_CR13","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.cie.2009.02.015","volume":"57","author":"SY Hsu","year":"2009","unstructured":"Hsu SY, Liu CH (2009) Improving the delivery efficiency of the customer order scheduling problem in a job shop. Comput Ind Eng 57:856\u2013866","journal-title":"Comput Ind Eng"},{"issue":"3","key":"3466_CR14","doi-asserted-by":"publisher","first-page":"04015040","DOI":"10.1061\/(ASCE)CP.1943-5487.0000514","volume":"30","author":"F Kang","year":"2016","unstructured":"Kang F, Li J (2016) Artificial bee colony algorithm optimized support vector regression for system reliability analysis of slopes. J Comput Civ Eng 30(3):04015040","journal-title":"J Comput Civ Eng"},{"key":"3466_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.compgeo.2014.08.010","volume":"63","author":"F Kang","year":"2015","unstructured":"Kang F, Salgado R, Li J (2015) System probabilistic stability analysis of soil slopes using Gaussian process regression with Latin hypercube sampling. Comput Geotech 63:13\u201325","journal-title":"Comput Geotech"},{"issue":"11\u201312","key":"3466_CR16","doi-asserted-by":"publisher","first-page":"6105","DOI":"10.1016\/j.apm.2016.01.050","volume":"40","author":"F Kang","year":"2016","unstructured":"Kang F, Xu Q, Li J (2016a) Slope reliability analysis using surrogate models via new support vector machines with swarm intelligence. Appl Math Model 40(11\u201312):6105\u20136120","journal-title":"Appl Math Model"},{"key":"3466_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.neucom.2015.11.122","volume":"209","author":"F Kang","year":"2016","unstructured":"Kang F, Li J-S, Li J (2016b) System reliability analysis of slopes using least squares support vector machines with particle swarm optimization. Neurocomputing 209:46\u201356","journal-title":"Neurocomputing"},{"key":"3466_CR18","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"3466_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"key":"3466_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ijpe.2013.01.025","volume":"144","author":"I-S Lee","year":"2013","unstructured":"Lee I-S (2013) Minimizing total tardiness for the order scheduling problem. Int J Prod Econ 144:128\u2013134","journal-title":"Int J Prod Econ"},{"key":"3466_CR21","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JYT Leung","year":"2005","unstructured":"Leung JYT, Li H, Pinedo M (2005a) Order scheduling in an environment with dedicated resources in parallel. J Sched 8:355\u2013386","journal-title":"J Sched"},{"issue":"2","key":"3466_CR22","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.ejor.2003.11.023","volume":"163","author":"JYT Leung","year":"2005","unstructured":"Leung JYT, Li H, Pinedo M, Sriskandarajah C (2005b) Open shops with jobs overlap-revisited. Eur J Oper Res 163(2):569\u2013571","journal-title":"Eur J Oper Res"},{"key":"3466_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/nav.20138","volume":"53","author":"JYT Leung","year":"2006","unstructured":"Leung JYT, Li H, Pinedo M (2006a) Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel. Naval Res Logist 53:243\u2013260","journal-title":"Naval Res Logist"},{"key":"3466_CR24","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.ejor.2004.03.030","volume":"168","author":"JYT Leung","year":"2006","unstructured":"Leung JYT, Li H, Pinedo M (2006b) Scheduling orders for multiple product types with due date related objectives. Eur J Oper Res 168:370\u2013389","journal-title":"Eur J Oper Res"},{"key":"3466_CR25","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"JYT Leung","year":"2007","unstructured":"Leung JYT, Li H, Pinedo M (2007a) Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl Math 155:945\u2013970","journal-title":"Discrete Appl Math"},{"key":"3466_CR26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ipl.2007.03.002","volume":"103","author":"JYT Leung","year":"2007","unstructured":"Leung JYT, Li H, Pinedo M, Zhang J (2007b) Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Inf Process Lett 103:119\u2013129","journal-title":"Inf Process Lett"},{"key":"3466_CR27","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-007-0270-5","volume":"159","author":"JYT Leung","year":"2008","unstructured":"Leung JYT, Li H, Pinedo M (2008a) Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time. Ann Oper Res 159:107\u2013123","journal-title":"Ann Oper Res"},{"key":"3466_CR28","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2007.05.052","volume":"190","author":"JYT Leung","year":"2008","unstructured":"Leung JYT, Lee CY, Ng CW, Young GH (2008b) Preemptive multiprocessor order scheduling to minimize total weighted flowtime. Eur J Oper Res 190:40\u201351","journal-title":"Eur J Oper Res"},{"key":"3466_CR29","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/S0305-0548(01)00039-9","volume":"29","author":"H Liang","year":"2002","unstructured":"Liang H, Yao X, Newton C, Hoffman D (2002) A new evolutionary approach to cutting stock problems with and without contiguity. Comput Oper Res 29:1641\u20131659","journal-title":"Comput Oper Res"},{"key":"3466_CR30","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","volume":"183","author":"BMT Lin","year":"2007","unstructured":"Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944\u2013948","journal-title":"Eur J Oper Res"},{"key":"3466_CR31","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.asoc.2016.09.038","volume":"52","author":"WC Lin","year":"2017","unstructured":"Lin WC, Yin Y, Cheng SR, Cheng TCE, Wu CH, Wu C-C (2017) Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Appl Soft Comput 52:877\u2013884","journal-title":"Appl Soft Comput"},{"key":"3466_CR32","doi-asserted-by":"crossref","unstructured":"Lucic P, Teodorovic D (2002) Transportation modeling: an artificial life approach. In: ICTAI, pp 216\u2013223","DOI":"10.1109\/TAI.2002.1180807"},{"key":"3466_CR33","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1016\/j.cor.2004.04.001","volume":"32","author":"L Monch","year":"2005","unstructured":"Monch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput Oper Res 32:2731\u20132750","journal-title":"Comput Oper Res"},{"key":"3466_CR150","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0377-2217(93)E0290-E","volume":"80","author":"C Reeves","year":"1995","unstructured":"Reeves C (1995) Heuristics for scheduling a single machine subject to unequal job release times. Eur J Oper Res 80:397\u2013403","journal-title":"Eur J Oper"},{"key":"3466_CR34","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625\u2013631","journal-title":"Appl Soft Comput"},{"key":"3466_CR35","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jnca.2017.01.031","volume":"83","author":"S Singh","year":"2017","unstructured":"Singh S, Mann P (2017) Energy efficient clustering protocol based on improved metaheuristic in wireless sensor networks. J Netw Comput Appl 83:40\u201352","journal-title":"J Netw Comput Appl"},{"key":"3466_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.swevo.2011.12.002","volume":"4","author":"S Sundar","year":"2012","unstructured":"Sundar S, Singh A (2012) A swarm intelligence approach to the early\/tardy scheduling problem. Swarm Evol Comput 4:25\u201332","journal-title":"Swarm Evol Comput"},{"key":"3466_CR37","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","volume":"54","author":"CS Sung","year":"1998","unstructured":"Sung CS, Yoon SH (1998) Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int J Prod Econ 54:247\u2013255","journal-title":"Int J Prod Econ"},{"issue":"August","key":"3466_CR38","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1080\/0308106032000154593","volume":"26\u20134","author":"D Teodorovic","year":"2003","unstructured":"Teodorovic D (2003) Transport modeling by multi-agent systems: a swarm intelligence approach. Transp Plan Technol 26\u20134(August):289\u2013312","journal-title":"Transp Plan Technol"},{"key":"3466_CR39","unstructured":"Teodorovic D, Dell\u2019orco M (2005) Bee colony optimisation\u2014a cooperative learning approach to complex transportation problems. In: 10th EWGT Meeting, Poznan, 13\u201316"},{"key":"3466_CR40","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/3-540-45356-3_79","volume-title":"Parallel problem solving from nature VI, Lecture Notes in Computer Science","author":"V Tereshko","year":"2000","unstructured":"Tereshko V (2000) Reaction\u2013diffusion model of a honeybee colony\u2019s foraging behaviour. In: Schoenauer M et al (eds) Parallel problem solving from nature VI, Lecture Notes in Computer Science, vol 1917. Springer, Berlin, pp 807\u2013816"},{"key":"3466_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1015652810815","volume":"9","author":"V Tereshko","year":"2002","unstructured":"Tereshko V, Lee T (2002) How information mapping patterns determine foraging behaviour of a honey bee colony. Open Syst Inf Dyn 9:181\u2013193","journal-title":"Open Syst Inf Dyn"},{"key":"3466_CR42","unstructured":"Tereshko V, Loengarov A (2005) Collective decision-making in honey bee foraging dynamics. In: Computing and information systems, pp 1352\u201394049"},{"key":"3466_CR43","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0377-2217(93)90347-P","volume":"71","author":"E Wagneur","year":"1993","unstructured":"Wagneur E, Sriskandarajah C (1993) Open shops with jobs overlap. Eur J Oper Res 71:366\u2013378","journal-title":"Eur J Oper Res"},{"key":"3466_CR44","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.omega.2005.09.007","volume":"35","author":"G Wang","year":"2007","unstructured":"Wang G, Cheng TCE (2007) Customer order scheduling to minimize total weighted completion time. Omega 35:623\u2013626","journal-title":"Omega"},{"key":"3466_CR45","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1007\/s00500-015-1900-5","volume":"21","author":"D-J Wang","year":"2017","unstructured":"Wang D-J, Kang C-C, Shiau Y-R, Wu C-C, Hsu P-H (2017a) A two-agent single-machine scheduling problem with late work criteria. Soft Comput 21:2015\u20132033","journal-title":"Soft Comput"},{"key":"3466_CR46","first-page":"806","volume":"21","author":"DJ Wang","year":"2017","unstructured":"Wang DJ, Yin Y, Wu W-H, Wu W-H, Wu C-C, Hsu PH (2017b) A two-agent single-machine scheduling problem to minimize the total cost with release dates. Soft Comput 21:806\u2013816","journal-title":"Soft Comput"},{"key":"3466_CR47","unstructured":"Wedde HF, Farooq M, Zhang Y (2004) BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior, ant colony, optimization and swarm intelligence. In: 4th international workshop, ANTS 2004, Brussels, Belgium, September 5\u20138"},{"key":"3466_CR48","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cie.2018.01.011","volume":"117","author":"C-C Wu","year":"2018","unstructured":"Wu C-C, Liu DS, Lin TY, Yang TH, Chung IH, Lin WC (2018) Bicriterion total flowtime and maximum tardiness minimization for an order scheduling problem. Comput Ind Eng 117:156\u2013213","journal-title":"Comput Ind Eng"},{"key":"3466_CR49","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jnca.2017.09.012","volume":"99","author":"Y Xin","year":"2017","unstructured":"Xin Y, Wang Y-D, Xie ZQ, Yang J (2017) A cooperative scheduling method based on the device load feedback for multiple tasks scheduling. J Netw Comput Appl 99:110\u2013119","journal-title":"J Netw Comput Appl"},{"key":"3466_CR50","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.cor.2016.04.021","volume":"74","author":"J Xu","year":"2016","unstructured":"Xu J, Wu C-C, Yin Y, Zhao CL, Chiou Y-T, Lin WC (2016a) An order scheduling problem with position-based learning effect. Comput Oper Res 74:175\u2013186","journal-title":"Comput Oper Res"},{"key":"3466_CR51","doi-asserted-by":"publisher","unstructured":"Xu X, Zhao Y, Wu M, Zhou Z, Ma Y (2016b) Stochastic customer order scheduling to minimize long-run expected order cycle time. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-016-2254-9","DOI":"10.1007\/s10479-016-2254-9"},{"issue":"9","key":"3466_CR52","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00500-017-2547-1","volume":"22","author":"Y Xue","year":"2018","unstructured":"Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22(9):2935\u20132952","journal-title":"Soft Comput"},{"key":"3466_CR53","volume-title":"Engineering optimizations via nature-inspired virtual bee algorithms, Lecture Notes in Computer Science, 3562","author":"XS Yang","year":"2005","unstructured":"Yang XS (2005a) Engineering optimizations via nature-inspired virtual bee algorithms, Lecture Notes in Computer Science, 3562. Springer, Berlin"},{"key":"3466_CR54","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1016\/j.cor.2003.12.008","volume":"32","author":"J Yang","year":"2005","unstructured":"Yang J (2005b) The complexity of customer order scheduling problems on parallel machines. Comput Oper Res 32:1921\u20131939","journal-title":"Comput Oper Res"},{"key":"3466_CR55","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10951-005-5315-5","volume":"8","author":"J Yang","year":"2005","unstructured":"Yang J, Posner ME (2005) Scheduling parallel machines for the customer order problem. J Sched 8:49\u201374","journal-title":"J Sched"},{"key":"3466_CR56","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ijpe.2004.03.005","volume":"96","author":"SH Yoon","year":"2005","unstructured":"Yoon SH, Sung CS (2005) Fixed pre-assembly scheduling on multiple fabrication machines. Int J Prod Econ 96:109\u2013118","journal-title":"Int J Prod Econ"},{"issue":"2","key":"3466_CR57","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2016.05.066","volume":"255","author":"Y Zhao","year":"2016","unstructured":"Zhao Y, Xu X, Li H, Liu Y (2016) Prioritized customer order scheduling to maximize throughput. Eur J Oper Res 255(2):345\u2013356","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3466-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3466-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3466-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T15:22:52Z","timestamp":1661872972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3466-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,28]]},"references-count":58,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3466"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3466-5","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,8,28]]},"assertion":[{"value":"28 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}