{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T23:03:42Z","timestamp":1774479822071,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s00521-023-09146-z","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T13:04:14Z","timestamp":1700571854000},"page":"2493-2506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Genetic algorithm with normal boundary intersection for multi-objective early\/tardy scheduling problem with carbon-emission consideration: a Pareto-optimum solution"],"prefix":"10.1007","volume":"36","author":[{"given":"Hudaifah","family":"Hudaifah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andriansyah","family":"Andriansyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Al-Shareef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. N.","family":"Darghouth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0997-9481","authenticated-orcid":false,"given":"Haitham","family":"Saleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"9146_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.techsoc.2021.101758","volume":"67","author":"I Alvarez-Meaza","year":"2021","unstructured":"Alvarez-Meaza I, Zarrabeitia-Bilbao E, Rio-Belver RM, Garechana-Anacabe G (2021) Green scheduling to achieve green manufacturing: pursuing a research agenda by mapping science. Technol Soc 67:101758. https:\/\/doi.org\/10.1016\/j.techsoc.2021.101758","journal-title":"Technol Soc"},{"key":"9146_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.suscom.2018.05.003","volume":"19","author":"L Mao","year":"2018","unstructured":"Mao L, Li Y, Peng G, Xu X, Lin W (2018) A multi-resource task scheduling algorithm for energy-performance trade-offs in green clouds. Sustain Comput: Informat Syst 19:233\u2013241. https:\/\/doi.org\/10.1016\/j.suscom.2018.05.003","journal-title":"Sustain Comput: Informat Syst"},{"key":"9146_CR3","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.ejor.2020.07.020","volume":"289","author":"D Anghinolfi","year":"2021","unstructured":"Anghinolfi D, Paolucci M, Ronco R (2021) A bi-objective heuristic approach for green identical parallel machine scheduling. Eur J Oper Res 289:416\u2013434. https:\/\/doi.org\/10.1016\/j.ejor.2020.07.020","journal-title":"Eur J Oper Res"},{"key":"9146_CR4","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.ins.2021.12.122","volume":"589","author":"M Li","year":"2022","unstructured":"Li M, Wang GG (2022) A review of green shop scheduling problem. Inf Sci 589:478\u2013496. https:\/\/doi.org\/10.1016\/j.ins.2021.12.122","journal-title":"Inf Sci"},{"key":"9146_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2023.136228","volume":"393","author":"P Wu","year":"2023","unstructured":"Wu P, Li N, Cheng J, Chu C (2023) Energy-efficient single-machine scheduling with release dates under time-of-use electricity tariffs. J Clean Prod 393:136228. https:\/\/doi.org\/10.1016\/j.jclepro.2023.136228","journal-title":"J Clean Prod"},{"key":"9146_CR6","doi-asserted-by":"publisher","first-page":"3337","DOI":"10.1109\/TCYB.2022.3192112","volume":"53","author":"F Zhao","year":"2023","unstructured":"Zhao F, Di S, Wang L (2023) A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem. IEEE Trans Cybern 53:3337\u20133350. https:\/\/doi.org\/10.1109\/TCYB.2022.3192112","journal-title":"IEEE Trans Cybern"},{"key":"9146_CR7","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.3934\/jimo.2020010","volume":"17","author":"Q Liu","year":"2021","unstructured":"Liu Q, Liu J, Dong Z, Zhan M, Mei Z, Ying B, Shao X (2021) Integrated optimization of process planning and scheduling for reducing carbon emissions. J Ind Manag Optim 17:1025\u20131055. https:\/\/doi.org\/10.3934\/jimo.2020010","journal-title":"J Ind Manag Optim"},{"key":"9146_CR8","doi-asserted-by":"publisher","first-page":"8588","DOI":"10.1109\/TII.2022.3220860","volume":"19","author":"F Zhao","year":"2023","unstructured":"Zhao F, Zhang H, Wang L (2023) A Pareto-Based discrete jaya algorithm for multiobjective carbon-efficient distributed blocking flow shop scheduling problem. IEEE Trans Ind Inf 19:8588\u20138599. https:\/\/doi.org\/10.1109\/TII.2022.3220860","journal-title":"IEEE Trans Ind Inf"},{"key":"9146_CR9","doi-asserted-by":"publisher","first-page":"3639","DOI":"10.1080\/00207540701223469","volume":"45","author":"JT Black","year":"2007","unstructured":"Black JT (2007) Design rules for implementing the Toyota Production System. Int J Prod Res 45:3639\u20133664. https:\/\/doi.org\/10.1080\/00207540701223469","journal-title":"Int J Prod Res"},{"key":"9146_CR10","doi-asserted-by":"publisher","first-page":"6124734","DOI":"10.1155\/2016\/6124734","volume":"2016","author":"C Low","year":"2016","unstructured":"Low C, Li RK, Wu GH (2016) Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval. Math Probl Eng 2016:6124734. https:\/\/doi.org\/10.1155\/2016\/6124734","journal-title":"Math Probl Eng"},{"key":"9146_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","volume":"35","author":"PS Ow","year":"1989","unstructured":"Ow PS, Morton TE (1989) The single machine early\/tardy problem. Manag Sci 35:177\u2013191. https:\/\/doi.org\/10.1287\/mnsc.35.2.177","journal-title":"Manag Sci"},{"key":"9146_CR12","doi-asserted-by":"publisher","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. The IBM research symposia series. Springer, Boston. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9146_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-6377(96)00054-5","volume":"20","author":"ST Webster","year":"1997","unstructured":"Webster ST (1997) The complexity of scheduling job families about a common due date. Oper Res Lett 20:65\u201374. https:\/\/doi.org\/10.1016\/S0167-6377(96)00054-5","journal-title":"Oper Res Lett"},{"key":"9146_CR14","doi-asserted-by":"crossref","unstructured":"Fang K, Uhan N, Zhao F, Sutherland JW (2011) A new shop scheduling approach in support of sustainable manufacturing. In: Hesselbach J, Herrmann C (eds) Glocalized solutions for sustainability in manufacturing, Proceedings of the 18th CIRP international conference on life cycle engineering. Technische Universit\u00e4t Braunschweig, Braunschweig, Germany, May 2nd\u20134th, 2011. Springer, Berlin, Heidelberg, pp 305\u2013310","DOI":"10.1007\/978-3-642-19692-8_53"},{"key":"9146_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1080\/0951192X.2013.834479","volume":"27","author":"CH Liu","year":"2014","unstructured":"Liu CH (2014) Approximate tradeoff between minimisation of total weighted tardiness and minimisation of carbon dioxide (CO2) emissions in bi-criteria batch scheduling problem. Int J Comput Integr Manuf 27:759\u2013771. https:\/\/doi.org\/10.1080\/0951192X.2013.834479","journal-title":"Int J Comput Integr Manuf"},{"key":"9146_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.cie.2016.12.008","volume":"104","author":"X Li","year":"2017","unstructured":"Li X, Xing K, Wu Y, Wang X, Luo J (2017) Total energy consumption optimization via genetic algorithm in flexible manufacturing systems. Comput Ind Eng 104:188\u2013200. https:\/\/doi.org\/10.1016\/j.cie.2016.12.008","journal-title":"Comput Ind Eng"},{"key":"9146_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100820","volume":"61","author":"X Wen","year":"2021","unstructured":"Wen X, Wang K, Li H, Sun H, Wang H, Jin L (2021) A two-stage solution method based on NSGA-II for Green Multi-Objective integrated process planning and scheduling in a battery packaging machinery workshop. Swarm Evol Comput 61:100820. https:\/\/doi.org\/10.1016\/j.swevo.2020.100820","journal-title":"Swarm Evol Comput"},{"key":"9146_CR18","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s12652-021-03330-6","volume":"14","author":"T Ning","year":"2021","unstructured":"Ning T, Huang Y (2021) Low carbon emission management for flexible job shop scheduling: a study case in China. J Ambient Intell Hum Comput 14:789\u2013805","journal-title":"J Ambient Intell Hum Comput"},{"key":"9146_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2022.118949","volume":"315","author":"S Trevino-Martinez","year":"2022","unstructured":"Trevino-Martinez S, Sawhney R, Shylo O (2022) Energy-carbon footprint optimization in sequence-dependent production scheduling. Appl Energy 315:118949. https:\/\/doi.org\/10.1016\/j.apenergy.2022.118949","journal-title":"Appl Energy"},{"key":"9146_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105604","volume":"138","author":"RG Saber","year":"2022","unstructured":"Saber RG, Ranjbar M (2022) Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem. Comput Oper Res 138:105604. https:\/\/doi.org\/10.1016\/j.cor.2021.105604","journal-title":"Comput Oper Res"},{"key":"9146_CR21","doi-asserted-by":"publisher","first-page":"22303","DOI":"10.1007\/s00521-022-07714-3","volume":"34","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem. Neural Comput Appl 34:22303\u201322330. https:\/\/doi.org\/10.1007\/s00521-022-07714-3","journal-title":"Neural Comput Appl"},{"key":"9146_CR22","doi-asserted-by":"publisher","DOI":"10.1201\/b12173","volume-title":"Carbon footprint analysis: concepts, methods, implementation, and case studies (systems innovation book series). Carbon footprint analysis","author":"M Franchetti","year":"2012","unstructured":"Franchetti M, Apul D (2012) Carbon footprint analysis: concepts, methods, implementation, and case studies (systems innovation book series). Carbon footprint analysis. CRC Press"},{"key":"9146_CR23","unstructured":"Department for Business E, IS (2022). Greenhouse gas reporting: Conversion factors 2021. GOV.UK. https:\/\/www.gov.uk\/government\/publications\/greenhouse-gas-reporting-conversion-factors-2021. Accessed 18 July 2022"},{"key":"9146_CR24","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.rcim.2013.04.001","volume":"29","author":"M Dai","year":"2013","unstructured":"Dai M, Tang D, Giret A, Salido MA, Li WD (2013) Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot Comput Integr Manuf 29:418\u2013429. https:\/\/doi.org\/10.1016\/j.rcim.2013.04.001","journal-title":"Robot Comput Integr Manuf"},{"key":"9146_CR25","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":"9146_CR26","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 multi-objective 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":"9146_CR27","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jclepro.2017.09.037","volume":"168","author":"Q Liu","year":"2017","unstructured":"Liu Q, Zhan M, Chekem FO, Shao X, Ying B, Sutherland JW (2017) A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing carbon footprint. J Clean Prod 168:668\u2013678. https:\/\/doi.org\/10.1016\/j.jclepro.2017.09.037","journal-title":"J Clean Prod"},{"key":"9146_CR28","doi-asserted-by":"publisher","first-page":"210","DOI":"10.3390\/a11120210","volume":"11","author":"H Zhang","year":"2018","unstructured":"Zhang H, Ge H, Pan R, Wu Y (2018) Multi-objective bi-level programming for the energy-aware integration of flexible job shop scheduling and multi-low layout. Algorithms 11:210. https:\/\/doi.org\/10.3390\/a11120210","journal-title":"Algorithms"},{"key":"9146_CR29","first-page":"1345","volume":"90","author":"J Rocholl","year":"2020","unstructured":"Rocholl J, M\u00f6nch L, Fowler J (2020) Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost. J Bus Econ 90:1345\u20131381","journal-title":"J Bus Econ"},{"key":"9146_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107526","volume":"109","author":"YZ Li","year":"2021","unstructured":"Li YZ, Pan QK, Gao KZ, Tasgetiren MF, Zhang B, Li JQ (2021) A green scheduling algorithm for the distributed flowshop problem. Appl Soft Comput 109:107526. https:\/\/doi.org\/10.1016\/j.asoc.2021.107526","journal-title":"Appl Soft Comput"},{"key":"9146_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107632","volume":"110","author":"M Salama","year":"2021","unstructured":"Salama M, Srinivas S (2021) Adaptive neighborhood simulated annealing for sustainability-oriented single machine scheduling with deterioration effect. Appl Soft Comput 110:107632. https:\/\/doi.org\/10.1016\/j.asoc.2021.107632","journal-title":"Appl Soft Comput"},{"key":"9146_CR32","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8:631\u2013657. https:\/\/doi.org\/10.1137\/S1052623496307510","journal-title":"SIAM J Optim"},{"key":"9146_CR33","doi-asserted-by":"crossref","unstructured":"Baker KR, Trietsch D (2009) Principles of sequencing and scheduling. In: Principles of sequencing and scheduling. Wiley, pp 86\u2013105","DOI":"10.1002\/9780470451793"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09146-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-023-09146-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-023-09146-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T15:08:09Z","timestamp":1705676889000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-023-09146-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,21]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["9146"],"URL":"https:\/\/doi.org\/10.1007\/s00521-023-09146-z","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,21]]},"assertion":[{"value":"19 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or nonfinancial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}