{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:31:10Z","timestamp":1770820270695,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s12293-019-00295-0","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T06:34:02Z","timestamp":1568961242000},"page":"423-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Estimation of distribution evolution memetic algorithm for the unrelated parallel-machine green scheduling problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Yue","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijian","family":"Rui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7878-6563","authenticated-orcid":false,"given":"Xianyu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiuzhi","family":"Sang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"issue":"1","key":"295_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10845-012-0672-3","volume":"25","author":"J Arnaout","year":"2014","unstructured":"Arnaout J, Musa R, Rabadi G (2014) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines-part II: enhancements and experimentations. J Intell Manuf 25(1):43\u201353","journal-title":"J Intell Manuf"},{"key":"295_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cie.2016.12.038","volume":"105","author":"JEC Arroyo","year":"2017","unstructured":"Arroyo JEC, Leung JYT (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Comput Ind Eng 105:84\u2013100","journal-title":"Comput Ind Eng"},{"issue":"12","key":"295_CR3","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1016\/j.ifacol.2016.07.834","volume":"49","author":"TV Avdeenko","year":"2016","unstructured":"Avdeenko TV, Mesentsev YA (2016) Efficient approaches to scheduling for unrelated parallel machines with release dates. IFAC PapersOnLine 49(12):1743\u20131748","journal-title":"IFAC PapersOnLine"},{"key":"295_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2015.02.020","volume":"579","author":"E Bampis","year":"2015","unstructured":"Bampis E, Letsios D, Lucarelli G (2015) Green scheduling, flows and matchings. Theoret Comput Sci 579:126\u2013136","journal-title":"Theoret Comput Sci"},{"key":"295_CR5","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.jclepro.2017.04.018","volume":"156","author":"A Che","year":"2017","unstructured":"Che A, Zhang S, Wu X (2017) Energy-conscious unrelated parallel machine scheduling under time-of-use electricity tariffs. J Clean Prod 156:688\u2013697","journal-title":"J Clean Prod"},{"issue":"4","key":"295_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jmsy.2011.08.004","volume":"30","author":"K Fang","year":"2011","unstructured":"Fang K, Uhan N, Zhao F, Sutherland JW (2011) A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J Manuf Syst 30(4):234\u2013240","journal-title":"J Manuf Syst"},{"key":"295_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.swevo.2018.02.014","volume":"42","author":"H Fang","year":"2018","unstructured":"Fang H, Zhou AM, Zhang H (2018) Information fusion in offspring generation: a case study in DE and EDA. Swarm Evolut Comput 42:99\u2013108","journal-title":"Swarm Evolut Comput"},{"key":"295_CR8","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"issue":"4","key":"295_CR9","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TSMCA.2008.923086","volume":"38","author":"BB Li","year":"2008","unstructured":"Li BB, Wang L, Liu B (2008) An effective PSO-based hybrid algorithm for multiobjective permutation flow shop scheduling. IEEE Trans Syst Man Cybern Part A Syst Hum 38(4):818\u2013831","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"issue":"1\u20134","key":"295_CR10","first-page":"1","volume":"84","author":"ZT Li","year":"2015","unstructured":"Li ZT, Yanga H, Zhangb S, Liub G (2015) Unrelated parallel machine scheduling problem with energy and tardiness cost. Int J Adv Manuf Technol 84(1\u20134):1\u201314","journal-title":"Int J Adv Manuf Technol"},{"key":"295_CR11","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.jmsy.2015.11.006","volume":"38","author":"K Li","year":"2016","unstructured":"Li K, Zhang X, Leung JYT, Yang SL (2016) Parallel machine scheduling problems in green manufacturing industry. J Manuf Syst 38:98\u2013106","journal-title":"J Manuf Syst"},{"key":"295_CR12","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.jclepro.2018.11.231","volume":"211","author":"ZC Liu","year":"2019","unstructured":"Liu ZC, Guo SS, Wang L (2019) Integrated green scheduling optimization of flexible job shop and crane transportation considering comprehensive energy consumption. J Clean Prod 211:765\u2013786","journal-title":"J Clean Prod"},{"key":"295_CR13","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.asoc.2018.02.018","volume":"66","author":"SJ Lu","year":"2018","unstructured":"Lu SJ, Liu XB, Pei J, Thai MT, Pardalos PM (2018) A hybrid ABC-TS algorithm for the unrelated parallel-batching machines scheduling problem with deteriorating jobs and maintenance activity. Appl Soft Comput 66:168\u2013182","journal-title":"Appl Soft Comput"},{"issue":"3","key":"295_CR14","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.ejor.2015.08.064","volume":"248","author":"SA Mansouri","year":"2016","unstructured":"Mansouri SA, Aktas E, Besikci B (2016) Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption. Eur J Oper Res 248(3):772\u2013788","journal-title":"Eur J Oper Res"},{"issue":"3","key":"295_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s12293-018-0265-6","volume":"10","author":"VJ Manuel","year":"2018","unstructured":"Manuel VJ, Oscar G, Juan L, Marta B, Ignacio HJ (2018) Combining data augmentation, edas and grammatical evolution for blood glucose forecasting. Memet Comput 10(3):267\u2013277","journal-title":"Memet Comput"},{"issue":"18\u201319","key":"295_CR16","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1080\/00207540701450013","volume":"45","author":"G Mouzon","year":"2007","unstructured":"Mouzon G, Yildirim MB, Twomey J (2007) Operational methods for minimization of energy consumption of manufacturing equipment. Int J Prod Res 45(18\u201319):4247\u20134271","journal-title":"Int J Prod Res"},{"issue":"1","key":"295_CR17","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume":"1141","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions I: binary parameters. Lect Notes Comput Sci 1141(1):178\u2013187","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"295_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s12293-013-0107-5","volume":"5","author":"I Pan","year":"2013","unstructured":"Pan I, Das S (2013) Design of hybrid regrouping PSO-GA based sub-optimal networked control system with random packet losses. Memet Comput 5(2):141\u2013153","journal-title":"Memet Comput"},{"key":"295_CR19","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.jclepro.2019.01.166","volume":"217","author":"H Safarzadeh","year":"2019","unstructured":"Safarzadeh H, Niaki STA (2019) Bi-objective green scheduling in uniform parallel machine environments. J Clean Prod 217:559\u2013572","journal-title":"J Clean Prod"},{"key":"295_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.cor.2014.08.002","volume":"53","author":"V Sels","year":"2015","unstructured":"Sels V, Coelho J, Manuel Dias A, Vanhoucke M (2015) Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Comput Oper Res 53:107\u2013117","journal-title":"Comput Oper Res"},{"key":"295_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.knosys.2014.11.016","volume":"74","author":"JN Shen","year":"2015","unstructured":"Shen JN, Wang L, Wang SY (2015) A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion. Knowl Based Syst 74:167\u2013175","journal-title":"Knowl Based Syst"},{"key":"295_CR22","first-page":"65","volume":"230","author":"PSI Valdez","year":"2014","unstructured":"Valdez PSI, Hern\u00e1ndez A, Botello S (2014) Repairing normal EDAs with selective repopulation. Appl Math Comput 230:65\u201377","journal-title":"Appl Math Comput"},{"key":"295_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.eswa.2017.09.054","volume":"93","author":"F Villa","year":"2018","unstructured":"Villa F, Vallada E, Fanjul-Peyro L (2018) Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Expert Syst Appl 93:28\u201338","journal-title":"Expert Syst Appl"},{"key":"295_CR24","volume-title":"Shop scheduling with genetic algorithms","author":"L Wang","year":"2003","unstructured":"Wang L (2003) Shop scheduling with genetic algorithms. Tsinghua University Press, Beijing"},{"key":"295_CR25","volume-title":"Estimation of distribution algorithms for scheduling","author":"L Wang","year":"2017","unstructured":"Wang L, Wang SY, Fang C (2017) Estimation of distribution algorithms for scheduling. Tsinghua University Press, Beijing"},{"issue":"1","key":"295_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TSMC.2015.2416127","volume":"46","author":"SY Wang","year":"2015","unstructured":"Wang SY, Wang L (2015) An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. IEEE Trans Syst Man Cybern Syst 46(1):139\u2013149","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"295_CR27","doi-asserted-by":"publisher","first-page":"3249","DOI":"10.1016\/j.jclepro.2017.10.342","volume":"172","author":"XL Wu","year":"2018","unstructured":"Wu XL, Sun YJ (2018) A green scheduling algorithm for flexible job shop with energy-saving measures. J Clean Prod 172:3249\u20133264","journal-title":"J Clean Prod"},{"key":"295_CR28","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.4028\/www.scientific.net\/AMR.139-141.1415","volume":"139\u2013141","author":"JJ Yu","year":"2010","unstructured":"Yu JJ (2010) Green scheduling and its solution. Adv Mater Res 139\u2013141:1415\u20131418","journal-title":"Adv Mater Res"},{"issue":"5","key":"295_CR29","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/TSMC.2016.2616347","volume":"48","author":"XL Zheng","year":"2018","unstructured":"Zheng XL, Wang L (2018) A collaborative multiobjective fruit fly optimization algorithm for the resource constrained unrelated parallel machine green scheduling problem. IEEE Trans Syst Man Cybern Syst 48(5):790\u2013800","journal-title":"IEEE Trans Syst Man Cybern Syst"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00295-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-019-00295-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00295-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T23:30:32Z","timestamp":1600471832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-019-00295-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,20]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["295"],"URL":"https:\/\/doi.org\/10.1007\/s12293-019-00295-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,20]]},"assertion":[{"value":"20 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}