{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:31:52Z","timestamp":1767195112829,"version":"3.48.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["309755\/2021-2"],"award-info":[{"award-number":["309755\/2021-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["407151\/2021-4"],"award-info":[{"award-number":["407151\/2021-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["404264\/2023-9"],"award-info":[{"award-number":["404264\/2023-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10878-025-01367-3","type":"journal-article","created":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T17:53:09Z","timestamp":1764438789000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comparative computational study for parallel-machine problems with sustainable manufacturing constraints"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3773-9787","authenticated-orcid":false,"given":"Levi R.","family":"Abreu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3920-089X","authenticated-orcid":false,"given":"Bruno A.","family":"Prata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,29]]},"reference":[{"key":"1367_CR1","doi-asserted-by":"publisher","first-page":"108128","DOI":"10.1016\/j.cie.2022.108128","volume":"168","author":"LR Abreu","year":"2022","unstructured":"Abreu LR, Nagano MS (2022) A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times. Comput & Industr Eng 168:108128","journal-title":"Comput & Industr Eng"},{"issue":"7","key":"1367_CR2","doi-asserted-by":"publisher","first-page":"2059","DOI":"10.1007\/s10845-022-01959-4","volume":"33","author":"J Adan","year":"2022","unstructured":"Adan J (2022) A hybrid genetic algorithm for parallel machine scheduling with setup times: a comparative study of metaheuristics on large problem instances. J Intell Manuf 33(7):2059\u20132073","journal-title":"J Intell Manuf"},{"key":"1367_CR3","doi-asserted-by":"crossref","unstructured":"de\u00a0Athayde\u00a0Prata B, de\u00a0Abreu LR, Fernandez-Viagas V (2025) A systematic review of permutation flow shop scheduling with due-date-related objectives. Comput & Operat Res. 106989","DOI":"10.1016\/j.cor.2025.106989"},{"issue":"1","key":"1367_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ijpe.2008.04.011","volume":"115","author":"D Biskup","year":"2008","unstructured":"Biskup D, Herrmann J, Gupta JN (2008) Scheduling identical parallel machines to minimize total tardiness. Int J Prod Econ 115(1):134\u2013142","journal-title":"Int J Prod Econ"},{"key":"1367_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"},{"key":"1367_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.jmsy.2020.09.004","volume":"57","author":"YL Chou","year":"2020","unstructured":"Chou YL, Yang JM, Wu CH (2020) An energy-aware scheduling algorithm under maximum power consumption constraints. J Manuf Syst 57:182\u2013197","journal-title":"J Manuf Syst"},{"issue":"2","key":"1367_CR7","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1111\/itor.12566","volume":"28","author":"LP Cota","year":"2021","unstructured":"Cota LP, Coelho VN, Guimar\u00e3es FG, Souza MJ (2021) Bi-criteria formulation for green scheduling with unrelated parallel machines with sequence-dependent setup times. Int Trans Oper Res 28(2):996\u20131017","journal-title":"Int Trans Oper Res"},{"key":"1367_CR8","doi-asserted-by":"publisher","first-page":"100601","DOI":"10.1016\/j.swevo.2019.100601","volume":"51","author":"LP Cota","year":"2019","unstructured":"Cota LP, Guimar\u00e3es FG, Ribeiro RG, Meneghini IR, de Oliveira FB, Souza MJ, Siarry P (2019) An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem. Swarm Evol Comput 51:100601","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1367_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico M, Martello S (1995) Optimal scheduling of tasks on identical parallel processors. ORSA J Comput 7(2):191\u2013200","journal-title":"ORSA J Comput"},{"key":"1367_CR10","doi-asserted-by":"crossref","unstructured":"Dur\u00e1n GA, Dur\u00e1n M, Faillace\u00a0Mullen NA, Vel\u00e1squez J (2024) An application of mathematical programming to a real case of the unrelated parallel machine problem. Ann. Operat. Res. 1\u201329","DOI":"10.1007\/s10479-024-05938-1"},{"issue":"1","key":"1367_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.cie.2012.10.002","volume":"64","author":"KT Fang","year":"2013","unstructured":"Fang KT, Lin BM (2013) Parallel-machine scheduling to minimize tardiness penalty and power cost. Comput & Indust Eng 64(1):224\u2013234","journal-title":"Comput & Indust Eng"},{"key":"1367_CR12","doi-asserted-by":"crossref","unstructured":"Fernandez-Viagas V, Framinan JM (2015) Controllable processing times in project and production management: Analysing the trade-off between processing times and the amount of resources. Math Problems Eng","DOI":"10.1155\/2015\/826318"},{"key":"1367_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput. & Operat. Res. 60:27\u201336","journal-title":"Comput. & Operat. Res."},{"issue":"24","key":"1367_CR14","doi-asserted-by":"publisher","first-page":"18623","DOI":"10.1007\/s00500-023-09086-9","volume":"27","author":"EE I\u015f\u0131k","year":"2023","unstructured":"I\u015f\u0131k EE, Topaloglu Yildiz S, \u015eat\u0131r Akpunar \u00d6 (2023) Constraint programming models for the hybrid flow shop scheduling problem and its extensions. Soft Comput 27(24):18623\u201318650","journal-title":"Soft Comput"},{"key":"1367_CR15","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2016.06.012","volume":"98","author":"K Karabulut","year":"2016","unstructured":"Karabulut K (2016) A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops. Comput & Industr Eng 98:300\u2013307","journal-title":"Comput & Industr Eng"},{"key":"1367_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2013.08.003","volume":"41","author":"V Kayvanfar","year":"2014","unstructured":"Kayvanfar V, Komaki GM, Aalaei A, Zandieh M (2014) Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput & Operat Res 41:31\u201343","journal-title":"Comput & Operat Res"},{"issue":"2","key":"1367_CR17","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(2):208\u2013217","journal-title":"IEEJ Trans Electr Electron Eng"},{"key":"1367_CR18","doi-asserted-by":"crossref","unstructured":"Laborie P (2018) An update on the comparison of mip, cp and hybrid approaches for mixed resource allocation and scheduling. In: International conference on the integration of constraint programming, artificial intelligence, and operations research, pp. 403\u2013411. Springer","DOI":"10.1007\/978-3-319-93031-2_29"},{"key":"1367_CR19","doi-asserted-by":"publisher","first-page":"100973","DOI":"10.1016\/j.swevo.2021.100973","volume":"67","author":"A LaTorre","year":"2021","unstructured":"LaTorre A, Molina D, Osaba E, Poyatos J, Del Ser J, Herrera F (2021) A prescription of methodological guidelines for comparing bio-inspired optimization algorithms. Swarm Evol Comput 67:100973","journal-title":"Swarm Evol Comput"},{"issue":"3","key":"1367_CR20","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10845-023-02094-4","volume":"35","author":"F Li","year":"2024","unstructured":"Li F, Lang S, Hong B, Reggelin T (2024) A two-stage RNN-based deep reinforcement learning approach for solving the parallel machine scheduling problem with due dates and family setups. J Intell Manuf 35(3):1107\u20131140","journal-title":"J Intell Manuf"},{"key":"1367_CR21","doi-asserted-by":"crossref","unstructured":"Liang P, Yang HD, Liu GS, Guo JH (2015) An ant optimization model for unrelated parallel machine scheduling with energy consumption and total tardiness. Math Problems Eng","DOI":"10.1155\/2015\/907034"},{"key":"1367_CR22","doi-asserted-by":"crossref","unstructured":"Mej\u00eda G, Yuraszeck F (2020) A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel\/setup times. European J Operat Res","DOI":"10.1016\/j.ejor.2020.02.010"},{"key":"1367_CR23","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2017","unstructured":"Montgomery DC (2017) Design and analysis of experiments. John Wiley & Sons"},{"issue":"4","key":"1367_CR24","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1287\/ijoc.2023.1287","volume":"35","author":"B Naderi","year":"2023","unstructured":"Naderi B, Ruiz R, Roshanaei V (2023) Mixed-integer programming vs. constraint programming for shop scheduling problems: new results and outlook. INFORMS J Comput 35(4):817\u2013843","journal-title":"INFORMS J Comput"},{"issue":"11","key":"1367_CR25","doi-asserted-by":"publisher","first-page":"5311","DOI":"10.3390\/app11115311","volume":"11","author":"R Nanthapodej","year":"2021","unstructured":"Nanthapodej R, Liu CH, Nitisiri K, Pattanapairoj S (2021) Variable neighborhood strategy adaptive search to solve parallel-machine scheduling to minimize energy consumption while considering job priority and control makespan. Appl Sci 11(11):5311","journal-title":"Appl Sci"},{"issue":"2","key":"1367_CR26","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/TASE.2020.2995078","volume":"18","author":"Z Pei","year":"2020","unstructured":"Pei Z, Wan M, Jiang ZZ, Wang Z, Dai X (2020) An approximation algorithm for unrelated parallel machine scheduling under TOU electricity tariffs. IEEE Trans Autom Sci Eng 18(2):743\u2013756","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1367_CR27","doi-asserted-by":"crossref","unstructured":"Peng Z, Zhang H, Tang H, Feng Y, Yin W (2022) Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect. J Intell Manuf 1\u201322","DOI":"10.1007\/s10845-020-01713-8"},{"issue":"3","key":"1367_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts CN, Van Wassenhove LN (1992) Single machine scheduling to minimize total late work. Oper Res 40(3):586\u2013595","journal-title":"Oper Res"},{"key":"1367_CR29","doi-asserted-by":"publisher","first-page":"100350","DOI":"10.1016\/j.rico.2023.100350","volume":"14","author":"BA Prata","year":"2024","unstructured":"Prata BA, Abreu LR, Nagano MS (2024) Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis. Result Contr Optimization 14:100350","journal-title":"Result Contr Optimization"},{"key":"1367_CR30","doi-asserted-by":"crossref","unstructured":"Prata BA, Fernandez-Viagas V, Framinan JM, Rodrigues CD (2022) Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput & Operat Res 105880","DOI":"10.1016\/j.cor.2022.105880"},{"key":"1367_CR31","doi-asserted-by":"publisher","first-page":"106159","DOI":"10.1016\/j.cor.2023.106159","volume":"153","author":"GA Rolim","year":"2023","unstructured":"Rolim GA, Nagano MS, de Athayde Prata B (2023) Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Comput & Operat Res 153:106159","journal-title":"Comput & Operat Res"},{"key":"1367_CR32","unstructured":"Rossi F, Van Beek P, Walsh T (2006) Handbook of constraint programming. Elsevier"},{"key":"1367_CR33","doi-asserted-by":"publisher","first-page":"119393","DOI":"10.1016\/j.jclepro.2019.119393","volume":"249","author":"H Saberi-Aliabad","year":"2020","unstructured":"Saberi-Aliabad H, Reisi-Nafchi M, Moslehi G (2020) Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs. J Clean Prod 249:119393","journal-title":"J Clean Prod"},{"issue":"3","key":"1367_CR34","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/s10878-020-00607-y","volume":"40","author":"N Sekkal","year":"2020","unstructured":"Sekkal N, Belkaid F (2020) A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints. J Comb Optim 40(3):660\u2013696","journal-title":"J Comb Optim"},{"issue":"13","key":"1367_CR35","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643\u20131666","journal-title":"Discret Appl Math"},{"key":"1367_CR36","doi-asserted-by":"publisher","first-page":"119428","DOI":"10.1016\/j.jclepro.2019.119428","volume":"249","author":"H Soleimani","year":"2020","unstructured":"Soleimani H, Ghaderi H, Tsai PW, Zarbakhshnia N, Maleki M (2020) Scheduling of unrelated parallel machines considering sequence-related setup time, start time-dependent deterioration, position-dependent learning and power consumption minimization. J Clean Prod 249:119428","journal-title":"J Clean Prod"},{"issue":"4","key":"1367_CR37","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s12293-019-00296-z","volume":"11","author":"M Tan","year":"2019","unstructured":"Tan M, Yang HL, Su YX (2019) Genetic algorithms with greedy strategy for green batch scheduling on non-identical parallel machines. Memetic Comput 11(4):439\u2013452","journal-title":"Memetic Comput"},{"issue":"2","key":"1367_CR38","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10878-014-9721-5","volume":"31","author":"L Wu","year":"2016","unstructured":"Wu L, Cheng CD (2016) On single machine scheduling with resource constraint. J Comb Optim 31(2):491\u2013505. https:\/\/doi.org\/10.1007\/s10878-014-9721-5","journal-title":"J Comb Optim"},{"key":"1367_CR39","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","volume":"82","author":"X Wu","year":"2019","unstructured":"Wu X, Che A (2019) A memetic differential evolution algorithm for energy-efficient parallel machine scheduling. Omega 82:155\u2013165","journal-title":"Omega"},{"issue":"4","key":"1367_CR40","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s12293-019-00295-0","volume":"11","author":"Y Xue","year":"2019","unstructured":"Xue Y, Rui Z, Yu X, Sang X, Liu W (2019) Estimation of distribution evolution memetic algorithm for the unrelated parallel-machine green scheduling problem. Memetic Comput 11(4):423\u2013437","journal-title":"Memetic Comput"},{"key":"1367_CR41","doi-asserted-by":"publisher","first-page":"112959","DOI":"10.1016\/j.eswa.2019.112959","volume":"141","author":"JC Yepes-Borrero","year":"2020","unstructured":"Yepes-Borrero JC, Villa F, Perea F, Caballero-Villalobos JP (2020) Grasp algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Expert Syst Appl 141:112959","journal-title":"Expert Syst Appl"},{"key":"1367_CR42","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10845-020-01561-6","volume":"32","author":"H Zhang","year":"2021","unstructured":"Zhang H, Wu Y, Pan R, Xu G (2021) Two-stage parallel speed-scaling machine scheduling under time-of-use tariffs. J Intell Manuf 32:91\u2013112","journal-title":"J Intell Manuf"},{"issue":"22","key":"1367_CR43","doi-asserted-by":"publisher","first-page":"6826","DOI":"10.1080\/00207543.2019.1685708","volume":"58","author":"L Zhang","year":"2020","unstructured":"Zhang L, Deng Q, Gong G, Han W (2020) A new unrelated parallel machine scheduling problem with tool changes to minimise the total energy consumption. Int J Prod Res 58(22):6826\u20136845","journal-title":"Int J Prod Res"},{"issue":"5","key":"1367_CR44","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 Cybernetics Syst 48(5):790\u2013800","journal-title":"IEEE Trans Syst Man Cybernetics Syst"},{"issue":"2","key":"1367_CR45","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1504\/IJOR.2021.115623","volume":"41","author":"BH Zhou","year":"2021","unstructured":"Zhou BH, Gu J (2021) Energy-awareness scheduling of unrelated parallel machine scheduling problems with multiple resource constraints. Int J Operat Res 41(2):196\u2013217","journal-title":"Int J Operat Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01367-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01367-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01367-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T15:28:25Z","timestamp":1767194905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01367-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,29]]},"references-count":45,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1367"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01367-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,11,29]]},"assertion":[{"value":"10 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2025","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 declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"45"}}