{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T08:09:55Z","timestamp":1768810195519,"version":"3.49.0"},"reference-count":72,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671168"],"award-info":[{"award-number":["71671168"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central Universities of China","award":["2013B18020204"],"award-info":[{"award-number":["2013B18020204"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1016\/j.asoc.2018.08.036","type":"journal-article","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T12:44:27Z","timestamp":1535805867000},"page":"283-305","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm"],"prefix":"10.1016","volume":"73","author":[{"given":"Chuang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8887-951X","authenticated-orcid":false,"given":"Rui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2018.08.036_b1","series-title":"AIP Conference Proceedings, vol. 1653","first-page":"020074","article-title":"Improving the resource efficiency of the german steel industry using material flow analysis","author":"M\u00fcller","year":"2015"},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1162\/108819805775247954","article-title":"Eco-efficiency trends in the UK steel and aluminum industries","volume":"9","author":"Dahlstr\u00f6m","year":"2005","journal-title":"J. Ind. Ecol."},{"issue":"5","key":"10.1016\/j.asoc.2018.08.036_b3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0959-6526(03)00104-5","article-title":"The value of resource efficiency in the food industry: a waste minimisation project in East Anglia, UK","volume":"12","author":"Henningsson","year":"2004","journal-title":"J. Cleaner Prod."},{"issue":"5","key":"10.1016\/j.asoc.2018.08.036_b4","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1111\/jiec.12373","article-title":"Towards a circular economy in australian agri-food industry: An application of input-output oriented approaches for analyzing resource efficiency and competitiveness potential","volume":"20","author":"Pagotto","year":"2016","journal-title":"J. Ind. Ecol."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.esd.2010.02.001","article-title":"Energy use and energy efficiency development in the German and Colombian textile industries","volume":"14","author":"Mart\u00ednez","year":"2010","journal-title":"Energy Sustain. Dev."},{"key":"10.1016\/j.asoc.2018.08.036_b6","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jclepro.2012.08.020","article-title":"From waste treatment to resource efficiency in the chemical industry: recovery of organic solvents from waters containing electrolytes by pervaporation","volume":"39","author":"Garc\u00eda","year":"2013","journal-title":"J. Cleaner Prod."},{"issue":"8","key":"10.1016\/j.asoc.2018.08.036_b7","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1007\/s10098-014-0732-9","article-title":"Improving resource efficiency in surface coating\/painting industry: practical experiences from a small-sized enterprise","volume":"16","author":"Alkaya","year":"2014","journal-title":"Clean Technol. Environ. Policy"},{"key":"10.1016\/j.asoc.2018.08.036_b8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.asoc.2017.01.044","article-title":"Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines","volume":"55","author":"Jia","year":"2017","journal-title":"Appl. Soft Comput."},{"issue":"1\u20134","key":"10.1016\/j.asoc.2018.08.036_b9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00170-012-3906-9","article-title":"Minimizing makespan in a two-machine no-wait flow shop with batch processing machines","volume":"63","author":"Muthuswamy","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b10","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","article-title":"Batching and scheduling jobs on batch and discrete processors","volume":"40","author":"Ahmadi","year":"1992","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2018.08.036_b11","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1080\/07408179808966485","article-title":"Batching and scheduling to minimize the makespan in the two-machine flowshop","volume":"30","author":"Cheng","year":"1998","journal-title":"IIE Trans."},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b12","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.cor.2005.05.028","article-title":"Makespan minimization in a no-wait flow shop problem with two batching machines","volume":"34","author":"Oulamara","year":"2007","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2018.08.036_b13","doi-asserted-by":"crossref","first-page":"4534","DOI":"10.1109\/TVT.2016.2582721","article-title":"Energy management in plug-in hybrid electric vehicles: Recent progress and a connected vehicles perspective","volume":"66","author":"Martinez","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/j.asoc.2018.08.036_b14","doi-asserted-by":"crossref","first-page":"1868","DOI":"10.1016\/j.rser.2017.05.283","article-title":"A review of supercapacitor modeling, estimation, and applications: A control\/management perspective","volume":"81","author":"Zhang","year":"2018","journal-title":"Renew. Sustain. Energy Rev."},{"issue":"3","key":"10.1016\/j.asoc.2018.08.036_b15","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TIA.2005.847277","article-title":"Fuel consumption minimization of a microgrid","volume":"41","author":"Hernandez-Aramburo","year":"2005","journal-title":"IEEE Trans. Ind. Appl."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/JSAC.2014.141210","article-title":"Minimizing base station power consumption","volume":"32","author":"Holtkamp","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b17","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","article-title":"Efficient algorithms for scheduling semiconductor burn-in operations","volume":"40","author":"Lee","year":"1992","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.21582","article-title":"Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations","volume":"61","author":"Tang","year":"2014","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.asoc.2018.08.036_b19","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.asoc.2016.10.008","article-title":"Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times","volume":"52","author":"Zhou","year":"2017","journal-title":"Appl. Soft Comput."},{"issue":"9\u201310","key":"10.1016\/j.asoc.2018.08.036_b20","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","article-title":"A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor","volume":"29","author":"Mathirajan","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2018.08.036_b21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0377-2217(95)00165-4","article-title":"Single machine batch scheduling with jointly compressible setup and processing times","volume":"153","author":"Ng","year":"2004","journal-title":"European J. Oper. Res."},{"issue":"19","key":"10.1016\/j.asoc.2018.08.036_b22","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.ipl.2011.07.005","article-title":"Scheduling a batching machine with convex resource consumption functions","volume":"111","author":"Oron","year":"2011","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.asoc.2018.08.036_b23","doi-asserted-by":"crossref","unstructured":"F. Jolai, H. Kor, S.M. Hatefi, H. Iranmanesh, A genetic algorithm for makespan minimization in a no-wait flow shop problem with two batching machines, in: 2009 International Conference on Computer Engineering and Technology, Vol Ii, Proceedings, 2009, pp. 238\u2013242.","DOI":"10.1109\/ICCET.2009.215"},{"issue":"16","key":"10.1016\/j.asoc.2018.08.036_b24","doi-asserted-by":"crossref","first-page":"4919","DOI":"10.1080\/00207543.2016.1140920","article-title":"Minimizing makespan in a no-wait flowshop with two batch processing machines using estimation of distribution algorithm","volume":"54","author":"Zhou","year":"2016","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.asoc.2018.08.036_b25","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1080\/07408170601181674","article-title":"The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times","volume":"39","author":"Shabtay","year":"2007","journal-title":"Iie Trans."},{"key":"10.1016\/j.asoc.2018.08.036_b26","first-page":"59","article-title":"Resource management in machine scheduling problems: a survey","volume":"Vol. 1, No. 1-2","author":"Janiak","year":"2007","journal-title":"Decis. Mak. Manuf. Serv."},{"issue":"5","key":"10.1016\/j.asoc.2018.08.036_b27","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","article-title":"Choosing the job sequence and processing times to minimize total processing plus flow cost on a single-machine","volume":"28","author":"Vickson","year":"1980","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2018.08.036_b28","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","article-title":"Two single machine sequencing problems involving controllable job processing times","volume":"12","author":"Vickson","year":"1980","journal-title":"AIIE Trans."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b29","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0377-2217(88)90355-4","article-title":"A two-machine flow shop scheduling problem with controllable job processing times","volume":"34","author":"Nowicki","year":"1988","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2018.08.036_b30","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(89)90009-4","article-title":"Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem","volume":"32","author":"Janiak","year":"1989","journal-title":"Inform. Process. Lett."},{"issue":"8","key":"10.1016\/j.asoc.2018.08.036_b31","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","article-title":"Single machine scheduling with a variable common due date and resource-dependent processing times","volume":"30","author":"Ng","year":"2003","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"10.1016\/j.asoc.2018.08.036_b32","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1016\/S0305-0548(03)00081-9","article-title":"Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine","volume":"31","author":"Shabtay","year":"2004","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2018.08.036_b33","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","article-title":"Single-machine scheduling with controllable processing times and number of jobs tardy","volume":"37","author":"Daniels","year":"1989","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b34","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","article-title":"Single machine scheduling subject to deadlines and resource dependent processing times","volume":"94","author":"Janiak","year":"1996","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.08.036_b35","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/ijoc.2015.0660","article-title":"Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines","volume":"28","author":"Shioura","year":"2016","journal-title":"Inf. J. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2018.08.036_b36","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","article-title":"Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions","volume":"15","author":"Monma","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.asoc.2018.08.036_b37","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1010918518726","article-title":"Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases","volume":"102","author":"Lee","year":"2001","journal-title":"Ann. Oper. Res."},{"issue":"10","key":"10.1016\/j.asoc.2018.08.036_b38","doi-asserted-by":"crossref","first-page":"3015","DOI":"10.1016\/j.cor.2005.02.032","article-title":"A bicriterion approach to time\/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates","volume":"33","author":"Kaspi","year":"2006","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2018.08.036_b39","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10951-007-0044-6","article-title":"A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine","volume":"10","author":"Yedidsion","year":"2007","journal-title":"J. Sched."},{"issue":"9","key":"10.1016\/j.asoc.2018.08.036_b40","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1080\/0951192X.2014.934293","article-title":"Approximately optimal algorithms for scheduling a single machine with general convex resource functions","volume":"28","author":"Liang","year":"2015","journal-title":"Int. J. Comput. Integr. Manuf."},{"issue":"3","key":"10.1016\/j.asoc.2018.08.036_b41","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","article-title":"Common due date assignment for scheduling on a single machine with jointly reducible processing times","volume":"69","author":"Biskup","year":"2001","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2018.08.036_b42","series-title":"Fonctions de rpartition n dimensions et leurs marges","author":"Sklar","year":"1959"},{"key":"10.1016\/j.asoc.2018.08.036_b43","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1214\/aos\/1176345528","article-title":"On nonparametric measures of dependence for random variables","author":"Schweizer","year":"1981","journal-title":"Ann. Stat."},{"key":"10.1016\/j.asoc.2018.08.036_b44","series-title":"An Introduction to Copulas","author":"Nelsen","year":"2007"},{"key":"10.1016\/j.asoc.2018.08.036_b45","first-page":"111","article-title":"The t copula and related copulas","author":"Demarta","year":"2005","journal-title":"Int. Stat. Rev."},{"issue":"3","key":"10.1016\/j.asoc.2018.08.036_b46","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1088\/1469-7688\/4\/3\/009","article-title":"Sampling from Archimedean copulas","volume":"4","author":"Whelan","year":"2004","journal-title":"Quant. Finance"},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.asoc.2018.08.036_b48","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s13748-011-0005-3","article-title":"A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems","volume":"1","author":"Ceberio","year":"2012","journal-title":"Progr. Artif. Intell."},{"key":"10.1016\/j.asoc.2018.08.036_b49","series-title":"Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning, Technical Report","author":"Baluja","year":"1994"},{"key":"10.1016\/j.asoc.2018.08.036_b50","series-title":"International Conference on Parallel Problem Solving from Nature","first-page":"418","article-title":"Extending population-based incremental learning to continuous search spaces","author":"Sebag","year":"1998"},{"key":"10.1016\/j.asoc.2018.08.036_b51","series-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","first-page":"57","article-title":"A review on estimation of distribution algorithms","author":"Larra\u00f1aga","year":"2002"},{"key":"10.1016\/j.asoc.2018.08.036_b52","series-title":"Advances in Soft Computing: Engineering Design and Manufacturing","first-page":"521","article-title":"The bivariate marginal distribution algorithm","author":"Pelikan","year":"1999"},{"key":"10.1016\/j.asoc.2018.08.036_b53","first-page":"424","article-title":"MIMIC: Finding optima by estimating probability densities","author":"De\u00a0Bonet","year":"1997","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2018.08.036_b54","series-title":"Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, vol. 1","first-page":"525","article-title":"BOA: The Bayesian optimization algorithm","author":"Pelikan","year":"1999"},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b55","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","article-title":"A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem","volume":"18","author":"Ceberio","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2018.08.036_b56","unstructured":"P. Larra\u00f1aga, R. Etxeberria, J.A. Lozano, J.M. Pe\u00f1a, Optimization in continuous domains by learning and simulation of Gaussian networks, (2000) 201\u2013204."},{"key":"10.1016\/j.asoc.2018.08.036_b57","series-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation","author":"Larraanaga","year":"2001"},{"key":"10.1016\/j.asoc.2018.08.036_b58","doi-asserted-by":"crossref","unstructured":"L.-F. Wang, J.-C. Zeng, Y. Hong, Estimation of distribution algorithm based on copula theory, in: 2009 IEEE Congress on Evolutionary Computation, 2009, 1057\u20131063, http:\/\/dx.doi.org\/10.1109\/CEC.2009.4983063.","DOI":"10.1109\/CEC.2009.4983063"},{"key":"10.1016\/j.asoc.2018.08.036_b59","doi-asserted-by":"crossref","unstructured":"B. Ye, H. Gao, X. Wang, J. Zeng, Estimation of distribution algorithm based on nested Archimedean copulas constructed with Levy Subordinators, in: 2010 IEEE 11th International Conference on Computer-Aided Industrial Design Conceptual Design 1, vol. 2, 2010, pp. 1586\u20131590, http:\/\/dx.doi.org\/10.1109\/CAIDCD.2010.5681902.","DOI":"10.1109\/CAIDCD.2010.5681902"},{"key":"10.1016\/j.asoc.2018.08.036_b60","doi-asserted-by":"crossref","unstructured":"A. Cuesta-Infante, R. Santana, J.I. Hidalgo, C. Bielza, P.L. naga, Bivariate empirical and n-variate Archimedean copulas in estimation of distribution algorithms, in: IEEE Congress on Evolutionary Computation, 2010, pp. 1\u20138, http:\/\/dx.doi.org\/10.1109\/CEC.2010.5586557.","DOI":"10.1109\/CEC.2010.5586557"},{"key":"10.1016\/j.asoc.2018.08.036_b61","series-title":"Computational Intelligence and 11th Brazilian Congress on Computational Intelligence (BRICS-CCI & CBIC), 2013 BRICS Congress on","first-page":"75","article-title":"Estimation of distribution algorithm based on a multivariate extension of the archimedean copula","author":"De\u00a0Mello","year":"2013"},{"issue":"3\u20134","key":"10.1016\/j.asoc.2018.08.036_b62","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s00180-013-0457-y","article-title":"Copula selection for graphical models in continuous estimation of distribution algorithms","volume":"29","author":"Salinas-Guti\u00e9rrez","year":"2014","journal-title":"Comput. Stat."},{"key":"10.1016\/j.asoc.2018.08.036_b63","series-title":"Foundations of Intelligent Systems","first-page":"591","article-title":"Multiobjective estimation of distribution algorithms using multivariate archimedean copulas and average ranking","author":"Gao","year":"2014"},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b64","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/TSMCC.2004.841914","article-title":"Clustering and learning gaussian distribution for continuous optimization","volume":"35","author":"Lu","year":"2005","journal-title":"IEEE Trans. Syst. Man Cybern. C"},{"key":"10.1016\/j.asoc.2018.08.036_b65","doi-asserted-by":"crossref","unstructured":"B. Yuan, M. Gallagher, Experimental results for the special session on real-parameter optimization at CEC 2005: a simple, continuous EDA, in: 2005 IEEE Congress on Evolutionary Computation, vol. 2, 2005, pp. 1792\u20131799 Vol. 2.","DOI":"10.1109\/CEC.2005.1554905"},{"issue":"1","key":"10.1016\/j.asoc.2018.08.036_b66","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TSG.2011.2151888","article-title":"Performance evaluation of an EDA-based large-scale plug-in hybrid electric vehicle charging algorithm","volume":"3","author":"Su","year":"2012","journal-title":"IEEE Trans. Smart Grid"},{"key":"10.1016\/j.asoc.2018.08.036_b67","series-title":"Probabilistic Metric Spaces","author":"Schweizer","year":"2011"},{"key":"10.1016\/j.asoc.2018.08.036_b68","series-title":"Associative Functions: Triangular Norms and Copulas","author":"Alsina","year":"2006"},{"issue":"403","key":"10.1016\/j.asoc.2018.08.036_b69","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1080\/01621459.1988.10478671","article-title":"Families of multivariate distributions","volume":"83","author":"Marshall","year":"1988","journal-title":"J. Amer. Statist. Assoc."},{"issue":"6","key":"10.1016\/j.asoc.2018.08.036_b70","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/TEVC.2014.2382135","article-title":"A Boltzmann-based estimation of distribution algorithm for a general resource scheduling model","volume":"19","author":"Liang","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b71","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00104-8","article-title":"Minimizing makespan in a blocking flowshop using genetic algorithms","volume":"70","author":"Caraffa","year":"2001","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"10.1016\/j.asoc.2018.08.036_b72","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"Eur. J. Oper. Res."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618304988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618304988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T07:39:28Z","timestamp":1543909168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494618304988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":72,"alternative-id":["S1568494618304988"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2018.08.036","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing the resource consumption of heterogeneous batch-processing machines using a copula-based estimation of distribution algorithm","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2018.08.036","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}