{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T14:39:09Z","timestamp":1775831949245,"version":"3.50.1"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s12065-020-00426-4","type":"journal-article","created":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T13:02:37Z","timestamp":1590930157000},"page":"1581-1595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Distributed-elite local search based on a genetic algorithm for bi-objective job-shop scheduling under time-of-use tariffs"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5596-0402","authenticated-orcid":false,"given":"Bobby","family":"Kurniawan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Fujimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"426_CR1","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.apenergy.2016.03.068","volume":"184","author":"M Kucukvar","year":"2016","unstructured":"Kucukvar M, Cansev B, Egilmez G, Onat NC, Samadi H (2016) Energy-climate-manufacturing nexus: new insights from the regional and global supply chains of manufacturing industries. Appl Energy 184:889\u2013904. https:\/\/doi.org\/10.1016\/j.apenergy.2016.03.068","journal-title":"Appl Energy"},{"key":"426_CR2","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1016\/j.enpol.2013.05.117","volume":"61","author":"S Okajima","year":"2013","unstructured":"Okajima S, Okajima H (2013) Analysis of energy intensity in Japan. Energy Policy 61:574\u2013586. https:\/\/doi.org\/10.1016\/j.enpol.2013.05.117","journal-title":"Energy Policy"},{"key":"426_CR3","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1016\/j.energy.2009.06.029","volume":"35","author":"P Cappers","year":"2010","unstructured":"Cappers P, Goldman C, Kathan D (2010) Demand response in U.S. electricity markets: empirical evidence. Energy 35:1526\u20131535. https:\/\/doi.org\/10.1016\/j.energy.2009.06.029","journal-title":"Energy"},{"key":"426_CR4","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:4247\u20134271. https:\/\/doi.org\/10.1080\/00207540701450013","journal-title":"Int J Prod Res"},{"key":"426_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2017.04.004","volume":"85","author":"A Che","year":"2017","unstructured":"Che A, Wu X, Peng J, Yan P (2017) Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Comput Oper Res 85:172\u2013183. https:\/\/doi.org\/10.1016\/j.cor.2017.04.004","journal-title":"Comput Oper Res"},{"issue":"5","key":"426_CR6","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.3901\/cjme.2015.0617.082","volume":"28","author":"D Tang","year":"2015","unstructured":"Tang D, Min D (2015) Energy-efficient approach to minimizing the energy consumption in an extended job-shop scheduling problem. Chin J Mech Eng 28(5):1048\u20131055. https:\/\/doi.org\/10.3901\/cjme.2015.0617.082","journal-title":"Chin J Mech Eng"},{"key":"426_CR7","doi-asserted-by":"publisher","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang R, Chiong R (2016) Solving the energy-efficient job shop scheduling problem: a multiobjective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. J Clean Prod 112:3361\u20133375. https:\/\/doi.org\/10.1016\/j.jclepro.2015.09.097","journal-title":"J Clean Prod"},{"key":"426_CR8","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2015.07.017","volume":"248","author":"C Gahm","year":"2016","unstructured":"Gahm C, Denz F, Dirr M, Tuma A (2016) Energy-efficient scheduling in manufacturing companies: a review and research framework. Eur J Oper Res 248:744\u2013757. https:\/\/doi.org\/10.1016\/j.ejor.2015.07.017","journal-title":"Eur J Oper Res"},{"key":"426_CR9","doi-asserted-by":"publisher","unstructured":"Kurniawan B, Gozali AA, Weng W, Fujimura S (2019) A mix integer programming model for bi-objective single machine with total weighted tardiness and electricity cost under time-of-use tariffs. In: Proceedings of 2018 IEEE international conference on industrial engineering & engineering management, pp 137\u2013141. https:\/\/doi.org\/10.1109\/IEEM.2018.8607420","DOI":"10.1109\/IEEM.2018.8607420"},{"key":"426_CR10","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00170-013-4749-8","volume":"68","author":"JY Moon","year":"2013","unstructured":"Moon JY, Shin K, Park J (2013) Optimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency. Int J Adv Manuf Technol 68:523\u2013535. https:\/\/doi.org\/10.1007\/s00170-013-4749-8","journal-title":"Int J Adv Manuf Technol"},{"key":"426_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.jclepro.2013.12.024","volume":"67","author":"F Shrouf","year":"2014","unstructured":"Shrouf F, Ordieres-Mer\u00e9 J, Garc\u00eda-S\u00e1nchez A, Ortega-Mier M (2014) Optimizing the production scheduling of a single machine to minimize total energy consumption costs. J Clean Prod 67:197\u2013207. https:\/\/doi.org\/10.1016\/j.jclepro.2013.12.024","journal-title":"J Clean Prod"},{"key":"426_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.cirp.2014.03.011","volume":"63","author":"H Zhang","year":"2014","unstructured":"Zhang H, Zhao F, Fang K, Sutherland JW (2014) Energy-conscious flow shop scheduling under time-of-use electricity tariffs. CIRP Ann Manuf Technol 63:37\u201340. https:\/\/doi.org\/10.1016\/j.cirp.2014.03.011","journal-title":"CIRP Ann Manuf Technol"},{"key":"426_CR13","doi-asserted-by":"publisher","first-page":"3173","DOI":"10.1080\/00207543.2017.1401236","volume":"56","author":"S Wang","year":"2018","unstructured":"Wang S, Zhu Z, Kan Fang, Chu F, Chu C (2018) Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs. Int J Prod Res 56:3173\u20133187. https:\/\/doi.org\/10.1080\/00207543.2017.1401236","journal-title":"Int J Prod Res"},{"key":"426_CR14","doi-asserted-by":"publisher","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:117\u2013129","journal-title":"Math Oper Res"},{"key":"426_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","volume":"265","author":"L Shena","year":"2018","unstructured":"Shena L, Dauz\u00e8re-P\u00e9r\u00e8s S, Neufeldd JS (2018) Solving the flexible job shop scheduling problem with sequence-dependent setup times. Eur J Oper Res 265:503\u2013516. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.021","journal-title":"Eur J Oper Res"},{"issue":"2","key":"426_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas E, Vazacopoulos A (1998) Guided local search with shifting bottleneck for job shop scheduling. Manag Sci 44(2):262\u2013275","journal-title":"Manag Sci"},{"key":"426_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","volume":"49","author":"P Brucker","year":"1994","unstructured":"Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl Math 49:107\u2013127. https:\/\/doi.org\/10.1016\/0166-218X(94)90204-6","journal-title":"Discrete Appl Math"},{"key":"426_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-007-0283-0","volume":"159","author":"C Artigues","year":"2008","unstructured":"Artigues C, Feillet D (2008) A branch and bound method for the job-shop problem with sequence-dependent setup times. Ann Oper Res 159:135\u2013159. https:\/\/doi.org\/10.1007\/s10479-007-0283-0","journal-title":"Ann Oper Res"},{"issue":"6","key":"426_CR19","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1080\/03052150802657290","volume":"41","author":"M Mahnam","year":"2009","unstructured":"Mahnam M, Moslehi G (2009) A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Eng Optim 41(6):521\u2013536","journal-title":"Eng Optim"},{"issue":"3","key":"426_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391\u2013401","journal-title":"Manag Sci"},{"issue":"4","key":"426_CR21","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B Giffler","year":"1960","unstructured":"Giffler B, Thompson GL (1960) Algorithms for solving production-scheduling problems. Oper Res 8(4):487\u2013503","journal-title":"Oper Res"},{"key":"426_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.cie.2015.02.011","volume":"83","author":"M Amirghasemi","year":"2015","unstructured":"Amirghasemi M, Zamani R (2015) An effective asexual genetic algorithm for solving the job shop scheduling problem. Comput Ind Eng 83:123\u2013138. https:\/\/doi.org\/10.1016\/j.cie.2015.02.011","journal-title":"Comput Ind Eng"},{"issue":"1","key":"426_CR23","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li P, Rao Y, Guan Z (2008) A very fast TS\/SA algorithm for the job shop scheduling problem. Comput Oper Res 35(1):282\u2013294","journal-title":"Comput Oper Res"},{"key":"426_CR24","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manag Sci 42:797\u2013813","journal-title":"Manag Sci"},{"issue":"11","key":"426_CR25","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"CY Zhang","year":"2007","unstructured":"Zhang CY, Li PG, Guan Z, Rao YQ (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34(11):3229\u20133242","journal-title":"Comput Oper Res"},{"key":"426_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cie.2016.03.011","volume":"96","author":"N Kundakci","year":"2016","unstructured":"Kundakci N, Kulak O (2016) Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput Ind Eng 96:31\u201351. https:\/\/doi.org\/10.1016\/j.cie.2016.03.011","journal-title":"Comput Ind Eng"},{"issue":"3","key":"426_CR27","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"TL Lin","year":"2010","unstructured":"Lin TL, Horng SJ, Kao TW, Chen YH, Run RS, Chen RJ, Lai JL, Kuo IH (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37(3):2629\u20132636. https:\/\/doi.org\/10.1016\/j.eswa.2009.08.015","journal-title":"Expert Syst Appl"},{"key":"426_CR28","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.asoc.2017.04.062","volume":"57","author":"RH Huang","year":"2017","unstructured":"Huang RH, Yu TH (2017) An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl Soft Comput 57:642\u2013656. https:\/\/doi.org\/10.1016\/j.asoc.2017.04.062","journal-title":"Appl Soft Comput"},{"key":"426_CR29","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.asoc.2018.04.001","volume":"68","author":"N Sharma","year":"2018","unstructured":"Sharma N, Sharma H, Sharma A (2018) Beer froth artificial bee colony algorithm for job-shop scheduling problem. Appl Soft Comput 68:507\u2013524. https:\/\/doi.org\/10.1016\/j.asoc.2018.04.001","journal-title":"Appl Soft Comput"},{"key":"426_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M Pinedo","year":"1999","unstructured":"Pinedo M, Singer M (1999) A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Nav Res Logist 46:1\u201317","journal-title":"Nav Res Logist"},{"key":"426_CR31","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0360-8352(02)00019-0","volume":"42","author":"M Asano","year":"2002","unstructured":"Asano M, Ohta H (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Comput Ind Eng 42:137\u2013147","journal-title":"Comput Ind Eng"},{"key":"426_CR32","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Mati Y, Dauz\u00e8re-P\u00e9r\u00e8s 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"},{"key":"426_CR33","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.cor.2015.07.011","volume":"66","author":"J Kuhpfal","year":"2016","unstructured":"Kuhpfal J, Bierwirth C (2016) A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective. Comput Oper Res 66:44\u201357. https:\/\/doi.org\/10.1016\/j.cor.2015.07.011","journal-title":"Comput Oper Res"},{"key":"426_CR34","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6:182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"426_CR35","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"426_CR36","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico M, Trubian M (1993) Applying tabu search to the job-shop scheduling problem. Ann Oper Res 41:231\u2013252","journal-title":"Ann Oper Res"},{"key":"426_CR37","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.epsr.2017.12.033","volume":"158","author":"CG Monyei","year":"2018","unstructured":"Monyei CG, Adewumi AO (2018) Integration of demand side and supply side energy management resources for optimal scheduling of demand response loads\u2014South Africa in focus. Electr Power Syst Res 158:92\u2013104. https:\/\/doi.org\/10.1016\/j.epsr.2017.12.033","journal-title":"Electr Power Syst Res"},{"key":"426_CR38","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.apenergy.2018.09.220","volume":"233\u2013234","author":"EM Craparo","year":"2019","unstructured":"Craparo EM, Sprague JG (2019) Integrated supply- and demand-side energy management for expeditionary environmental control. Appl Energy 233\u2013234:352\u2013366. https:\/\/doi.org\/10.1016\/j.apenergy.2018.09.220","journal-title":"Appl Energy"},{"key":"426_CR39","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.solener.2018.05.003","volume":"169","author":"HA Bagal","year":"2018","unstructured":"Bagal HA, Soltanabad YN, Dadjuo M, Wakil K, Ghadimi N (2018) Risk-assessment of photovoltaic-wind-battery-grid based large industrial consumer using information gap decision theory. Sol Energy 169:343\u2013352. https:\/\/doi.org\/10.1016\/j.solener.2018.05.003","journal-title":"Sol Energy"},{"key":"426_CR40","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1016\/j.jclepro.2019.01.085","volume":"215","author":"O Abedinia","year":"2019","unstructured":"Abedinia O, Zareinejad M, Doranehgard MH, Fathi G, Noradin G (2019) Optimal offering and bidding strategies of renewable energy based large consumer using a novel hybrid robust-stochastic approach. J Clean Prod 215:878\u2013889. https:\/\/doi.org\/10.1016\/j.jclepro.2019.01.085","journal-title":"J Clean Prod"},{"key":"426_CR41","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ijepes.2018.11.012","volume":"107","author":"K Sadovskaia","year":"2019","unstructured":"Sadovskaia K, Bogdanov D, Honkapuro S, Breyer C (2019) Power transmission and distribution losses\u2014a model based on available empirical data and future trends for all countries globally. Int J Electr Power Energy Syst 107:98\u2013109. https:\/\/doi.org\/10.1016\/j.ijepes.2018.11.012","journal-title":"Int J Electr Power Energy Syst"},{"key":"426_CR42","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.applthermaleng.2018.04.008","volume":"137","author":"H Khodaei","year":"2018","unstructured":"Khodaei H, Hajiali M, Darvishan A, Sepehr M, Ghadimi N (2018) Fuzzy-based heat and power hub models for cost-emission operation of an industrial consumer using compromise programming. Appl Therm Eng 137:395\u2013405. https:\/\/doi.org\/10.1016\/j.applthermaleng.2018.04.008","journal-title":"Appl Therm Eng"},{"key":"426_CR43","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ijepes.2018.07.014","volume":"104","author":"W Gao","year":"2019","unstructured":"Gao W, Darvishan A, Toghani M, Mohammadi M, Abedinia O, Ghadimi N (2019) Different states of multi-block based forecast engine for price and load prediction. Int J Electr Power Energy Syst 104:423\u2013435. https:\/\/doi.org\/10.1016\/j.ijepes.2018.07.014","journal-title":"Int J Electr Power Energy Syst"},{"key":"426_CR44","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.energy.2018.07.088","volume":"161","author":"N Ghadimi","year":"2019","unstructured":"Ghadimi N, Akbarimajd A, Shayeghi H, Abedinia O (2019) Two stage forecast engine with feature selection technique and improved meta-heuristic algorithm for electricity load forecasting. Energy 161:130\u2013142. https:\/\/doi.org\/10.1016\/j.energy.2018.07.088","journal-title":"Energy"},{"key":"426_CR45","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1016\/j.applthermaleng.2018.11.122","volume":"148","author":"M Saeedi","year":"2019","unstructured":"Saeedi M, Moradi M, Hosseini M, Emamifar A, Ghadimi N (2019) Robust optimization based optimal chiller loading under cooling demand uncertainty. Appl Therm Eng 148:1081\u20131091. https:\/\/doi.org\/10.1016\/j.applthermaleng.2018.11.122","journal-title":"Appl Therm Eng"},{"key":"426_CR46","doi-asserted-by":"publisher","unstructured":"Chandramitasari W, Kurniawan B, Fujimura S (2018) Building deep neural network model for short term electricity consumption forecasting. In: Proceedings 2018 international symposium on advanced intelligent informatics (SAIN), pp 43\u201348. https:\/\/doi.org\/10.1109\/SAIN.2018.8673340","DOI":"10.1109\/SAIN.2018.8673340"},{"key":"426_CR47","doi-asserted-by":"publisher","unstructured":"Kurniawan B, Gozali AA, Weng W, Fujimura S (2018) A genetic algorithm for unrelated parallel machine scheduling minimizing makespan cost and electricity cost under time-of-use (TOU) tariffs with job delay mechanism. In: Proceedings of 2017 IEEE international conference on industrial engineering and engineering management, pp 583\u2013587. https:\/\/doi.org\/10.1109\/IEEM.2017.8289958","DOI":"10.1109\/IEEM.2017.8289958"},{"issue":"2","key":"426_CR48","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/19397030802257236","volume":"1","author":"G Mouzon","year":"2008","unstructured":"Mouzon G, Yildirim MB (2008) A framework to minimise total energy consumption and total tardiness on a single machine. Int J Sustain Eng 1(2):105\u2013116. https:\/\/doi.org\/10.1080\/19397030802257236","journal-title":"Int J Sustain Eng"},{"key":"426_CR49","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.orp.2019.100105","volume":"6","author":"MM Aghelinejad","year":"2019","unstructured":"Aghelinejad MM, Ouazene Y, Yalaoui A (2019) Complexity analysis of energy-efficient single machine scheduling problems. Oper Res Perspect 6:100\u2013105. https:\/\/doi.org\/10.1016\/j.orp.2019.100105","journal-title":"Oper Res Perspect"},{"key":"426_CR50","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ejor.2015.08.064","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. https:\/\/doi.org\/10.1016\/j.ejor.2015.08.064","journal-title":"J Manuf Syst"},{"key":"426_CR51","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.epsr.2017.12.033","volume":"208","author":"JB Abikarram","year":"2019","unstructured":"Abikarram JB, McConky K, Proano R (2019) Energy cost minimization for unrelated parallel machine scheduling under real time and demand charge pricing. J Clean Prod 208:232\u2013242. https:\/\/doi.org\/10.1016\/j.epsr.2017.12.033","journal-title":"J Clean Prod"},{"key":"426_CR52","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.jclepro.2016.06.161","volume":"137","author":"J Yan","year":"2016","unstructured":"Yan J, Li L, Zhao F, Zhang F, Zhao Q (2016) A multi-level optimization approach for energy-efficient flexible flow shop scheduling. J Clean Prod 137:1543\u20131552. https:\/\/doi.org\/10.1016\/j.jclepro.2016.06.161","journal-title":"J Clean Prod"},{"key":"426_CR53","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 U (2016) Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption. Eur J Oper Res 248:772\u2013788. https:\/\/doi.org\/10.1016\/j.ejor.2015.08.064","journal-title":"Eur J Oper Res"},{"key":"426_CR54","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8574892","author":"T Jiang","year":"2018","unstructured":"Jiang T, Zhang C, Zhu H, Den G (2018) Energy-efficient scheduling for a job shop using Grey Wolf optimization algorithm with double-searching mode. Math Problems Eng. https:\/\/doi.org\/10.1155\/2018\/8574892","journal-title":"Math Problems Eng"},{"issue":"4","key":"426_CR55","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1080\/01605682.2018.1452537","volume":"70","author":"A Corominas","year":"2019","unstructured":"Corominas A, Garc\u00eda-Villoria A, Gonz\u00e1lez NA, Pastor R (2019) A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs. J Oper Res Soc 70(4):620\u2013633. https:\/\/doi.org\/10.1080\/01605682.2018.1452537","journal-title":"J Oper Res Soc"},{"issue":"6","key":"426_CR56","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1016\/j.cor.2010.09.015","volume":"38","author":"K B\u00fclb\u00fcl","year":"2011","unstructured":"B\u00fclb\u00fcl K (2011) A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput Oper Res 38(6):967\u2013983. https:\/\/doi.org\/10.1016\/j.cor.2010.09.015","journal-title":"Comput Oper Res"},{"key":"426_CR57","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2011.01.046","volume":"212","author":"Y Mati","year":"2011","unstructured":"Mati Y, Dauz\u00e8re-P\u00e9r\u00e8s S, Lahlou C (2011) A general approach for optimizing regular criteria in the job-shop scheduling problem. Eur J Oper Res 212:33\u201342. https:\/\/doi.org\/10.1016\/j.ejor.2011.01.046","journal-title":"Eur J Oper Res"},{"key":"426_CR58","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2017.03.030","volume":"261","author":"C Bierwirth","year":"2017","unstructured":"Bierwirth C, Kuhpfal J (2017) Extended GRASP for the job shop scheduling problem with total weighted tardiness objective. Eur J Oper Res 261:835\u2013848. https:\/\/doi.org\/10.1016\/j.ejor.2017.03.030","journal-title":"Eur J Oper Res"},{"key":"426_CR59","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1007\/s00500-012-0880-y","volume":"16","author":"MA Gonz\u00e1lez","year":"2012","unstructured":"Gonz\u00e1lez MA, Gonz\u00e1lez-Rodr\u00edguez I, Vela CR, Varela R (2012) An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization. Soft Comput 16:2097\u20132113. https:\/\/doi.org\/10.1007\/s00500-012-0880-y","journal-title":"Soft Comput"},{"key":"426_CR60","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.ijpe.2019.03.021","volume":"216","author":"O Masmoudi","year":"2019","unstructured":"Masmoudi O, Delorme X, Gianessi P (2019) Job-shop scheduling problem with energy consideration. Int J Prod Econ 216:12\u201322. https:\/\/doi.org\/10.1016\/j.ijpe.2019.03.021","journal-title":"Int J Prod Econ"},{"key":"426_CR61","doi-asserted-by":"publisher","first-page":"7071","DOI":"10.1080\/00207543.2015.1005248","volume":"53","author":"G May","year":"2015","unstructured":"May G, Stahl B, Taisch M, Prabhu V Vittal (2015) Multi-objective genetic algorithm for energy-efficient job shop scheduling. Int J Prod Res 5:7071\u20137089. https:\/\/doi.org\/10.1080\/00207543.2015.1005248","journal-title":"Int J Prod Res"},{"key":"426_CR62","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1155\/2018\/8574892","volume":"65","author":"Y Liu","year":"2014","unstructured":"Liu Y, Dong H, Lohse N, Petrovic S, Gindy N (2014) An investigation into minimising total energy consumption and total weighted tardiness in job shops. J Clean Prod 65:87\u201396. https:\/\/doi.org\/10.1155\/2018\/8574892","journal-title":"J Clean Prod"},{"key":"426_CR63","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1007\/s00170-015-7987-0","volume":"85","author":"MA Salido","year":"2016","unstructured":"Salido MA, Escamilla J, Giret A, Barber F (2016) A genetic algorithm for energy-efficiency in job-shop scheduling. Int J Adv Manuf Technol 85:1303\u20131314. https:\/\/doi.org\/10.1007\/s00170-015-7987-0","journal-title":"Int J Adv Manuf Technol"},{"key":"426_CR64","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10479-015-2003-5","volume":"238","author":"K Fang","year":"2016","unstructured":"Fang K, Uhan NA, Zhao F, Sutherland JW (2016) Scheduling on a single machine under time-of-use electricity tariffs. Ann Oper Res 238:199\u2013227. https:\/\/doi.org\/10.1007\/s10479-015-2003-5","journal-title":"Ann Oper Res"},{"key":"426_CR65","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.jclepro.2016.03.150","volume":"129","author":"A Che","year":"2016","unstructured":"Che A, Zeng Y, Lyu K (2016) An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs. J Clean Prod 129:565\u2013577. https:\/\/doi.org\/10.1016\/j.jclepro.2016.03.150","journal-title":"J Clean Prod"},{"key":"426_CR66","doi-asserted-by":"publisher","first-page":"5558","DOI":"10.1080\/00207543.2017.1414969","volume":"56","author":"MM Aghelinejad","year":"2018","unstructured":"Aghelinejad MM, Ouazene Y, Yalaoui A (2018) Production scheduling optimisation with machine state and time-dependent energy costs. Int J Prod Res 56:5558\u20135575. https:\/\/doi.org\/10.1080\/00207543.2017.1414969","journal-title":"Int J Prod Res"},{"key":"426_CR67","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.cie.2017.04.026","volume":"112","author":"J Cheng","year":"2017","unstructured":"Cheng J, Chu F, Liu M, Wue P, Xia W (2017) Bi-criteria single-machine batch scheduling with machine on\/off witching under time-of-use tariffs. Comput Ind Eng 112:721\u2013734. https:\/\/doi.org\/10.1016\/j.cie.2017.04.026","journal-title":"Comput Ind Eng"},{"key":"426_CR68","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jclepro.2015.06.002","volume":"108","author":"A Sharma","year":"2015","unstructured":"Sharma A, Zhao F, Sutherland JW (2015) Econological scheduling of manufacturing enterprise operating under a time-of-use electricity tariff. J Clean Prod 108:256\u2013270. https:\/\/doi.org\/10.1016\/j.jclepro.2015.06.002","journal-title":"J Clean Prod"},{"key":"426_CR69","doi-asserted-by":"publisher","first-page":"2803","DOI":"10.1007\/s00170-016-8375-0","volume":"86","author":"J Koo","year":"2016","unstructured":"Koo J, Kim BI (2016) Some comments on \u201cOptimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency\u201d. Int J Adv Manuf Technol 86:2803\u20132806. https:\/\/doi.org\/10.1007\/s00170-016-8375-0","journal-title":"Int J Adv Manuf Technol"},{"key":"426_CR70","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1002\/tee.23047","volume":"15","author":"B Kurniawan","year":"2020","unstructured":"Kurniawan B, Chandramitasari W, Gozali AA, Weng W, Fujimura S (2020) Triple-chromosome genetic algorithm for unrelated parallel machine scheduling under time-of-use tariffs. IEEJ Trans Electr Electron Eng 15:208\u2013217. https:\/\/doi.org\/10.1002\/tee.23047","journal-title":"IEEJ Trans Electr Electron Eng"},{"key":"426_CR71","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","volume":"13","author":"JY Ding","year":"2016","unstructured":"Ding JY, Song S, Zhang R, Chiong R (2016) Parallel machine scheduling under time-of-use electricity prices: new models and optimization approaches. IEEE Trans Autom Sci Eng 13:1138\u20131154. https:\/\/doi.org\/10.1109\/TASE.2015.2495328","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"426_CR72","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. https:\/\/doi.org\/10.1016\/j.jclepro.2017.04.018","journal-title":"J Clean Prod"},{"key":"426_CR73","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1109\/TASE.2016.2631491","volume":"15","author":"J Cheng","year":"2018","unstructured":"Cheng J, Chu F, Zhou MC (2018) An improved model for parallel machine scheduling under time-of-use electricity price. IEEE Trans Autom Sci Eng 15:896\u2013899. https:\/\/doi.org\/10.1109\/TASE.2016.2631491","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"426_CR74","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/0305215X.2017.1296437","volume":"50","author":"YZ Zeng","year":"2018","unstructured":"Zeng YZ, Che A, Wu X (2018) Bi-objective scheduling on uniform parallel machines considering electricity cost. Eng Optim 50:19\u201336. https:\/\/doi.org\/10.1080\/0305215X.2017.1296437","journal-title":"Eng Optim"},{"key":"426_CR75","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne AS (1960) On the job-shop scheduling. Oper Res 8:219\u2013223","journal-title":"Oper Res"},{"key":"426_CR76","doi-asserted-by":"publisher","first-page":"101995","DOI":"10.1016\/j.omega.2018.11.004","volume":"90","author":"M Liu","year":"2019","unstructured":"Liu M, Yang X, Chu F, Zhang J, Chu C (2019) Energy-oriented bi-objective optimization for the tempered glass scheduling. Omega 90:101995. https:\/\/doi.org\/10.1016\/j.omega.2018.11.004","journal-title":"Omega"},{"key":"426_CR77","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/0360-8352(96)00047-2","volume":"30","author":"R Cheng","year":"1996","unstructured":"Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job shop scheduling problem using genetic algorithm\u2014I. Representation. Comput Ind Eng 30:983\u2013997","journal-title":"Comput Ind Eng"},{"key":"426_CR78","unstructured":"Veldhuizen DAV (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Dissertation, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB"},{"key":"426_CR79","unstructured":"Beasley JE (2018) OR-Library. http:\/\/people.brunel.ac.uk\/mastjib\/jeb\/info.html. 25 Nov 2018"},{"key":"426_CR80","unstructured":"Taillard E (2019) Scheduling instances. http:\/\/mistic.heig-vd.ch\/taillard. 25 June 2019"},{"key":"426_CR81","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm. Technical report, Swiss Federal Institute of Technology (ETH), Zurich"},{"key":"426_CR82","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2013","unstructured":"Montgomery DC (2013) Design and analysis of experiments, 8th edn. Wiley, Hoboken","edition":"8"},{"key":"426_CR83","unstructured":"JASP Team (2020). JASP (Version 0.12.2)[Computer software]"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00426-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00426-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00426-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T13:19:22Z","timestamp":1635081562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00426-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":83,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["426"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00426-4","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"21 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}