{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T22:44:12Z","timestamp":1770245052008,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:00:00Z","timestamp":1767830400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10479-025-07010-y","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T09:47:02Z","timestamp":1767865622000},"page":"803-835","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comparative computational study for single-machine problems with controllable processing times and limited resource consumption"],"prefix":"10.1007","volume":"357","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":[[2026,1,8]]},"reference":[{"key":"7010_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108128","volume":"168","author":"LR Abreu","year":"2022","unstructured":"Abreu, L. R., & Nagano, M. S. (2022). A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times. Computers & Industrial Engineering,168, Article 108128.","journal-title":"Computers & Industrial Engineering"},{"key":"7010_CR2","first-page":"1","volume":"11","author":"LR Abreu","year":"2025","unstructured":"Abreu, L. R., & Prata, B. A. (2025). Exact methods for the parallel machines scheduling problem with identical machines, controllable processing times, and resource consumption. Proceeding Series of the Brazilian Society of Computational and Applied Mathematics,11, 1\u20137.","journal-title":"Proceeding Series of the Brazilian Society of Computational and Applied Mathematics"},{"issue":"6","key":"7010_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10732-006-6662-x","volume":"12","author":"VA Armentano","year":"2006","unstructured":"Armentano, V. A., & De Araujo, O. C. B. (2006). Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times. Journal of Heuristics,12(6), 427\u2013446.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"7010_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J. C. (1994). Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing,6(2), 154\u2013160.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"7010_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0377-2217(95)00149-2","volume":"93","author":"M Ben-Daya","year":"1996","unstructured":"Ben-Daya, M., & Al-Fawzan, M. (1996). A simulated annealing approach for the one-machine mean tardiness scheduling problem. European Journal of Operational Research,93(1), 61\u201367.","journal-title":"European Journal of Operational Research"},{"key":"7010_CR6","doi-asserted-by":"crossref","unstructured":"Biskup, D., & CHENG, T. E. (1999). Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization31(3), 329\u2013336.","DOI":"10.1080\/03052159908941376"},{"issue":"1","key":"7010_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10951-024-00824-x","volume":"28","author":"R Brouwer","year":"2025","unstructured":"Brouwer, R., Van Den Akker, M., & Hoogeveen, H. (2025). A hybrid local search algorithm for the continuous energy-constrained scheduling problem. Journal of Scheduling,28(1), 65\u201384.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"7010_CR8","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.cor.2007.10.002","volume":"36","author":"TE Cheng","year":"2009","unstructured":"Cheng, T. E., Lazarev, A. A., & Gafarov, E. R. (2009). A hybrid algorithm for the single-machine total tardiness problem. Computers & Operations Research,36(2), 308\u2013315.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"7010_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","volume":"39","author":"C Chu","year":"1992","unstructured":"Chu, C. (1992). A branch-and-bound algorithm to minimize total tardiness with different release dates. Naval Research Logistics (NRL),39(2), 265\u2013283.","journal-title":"Naval Research Logistics (NRL)"},{"key":"7010_CR10","doi-asserted-by":"crossref","unstructured":"Della Croce, F., Salassa, F., & T\u2019kindt, V. (2014). A hybrid heuristic approach for single machine scheduling with release times. Computers & Operations Research45, 7\u201311.","DOI":"10.1016\/j.cor.2013.11.016"},{"issue":"3","key":"7010_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is np-hard. Mathematics of operations research,15(3), 483\u2013495.","journal-title":"Mathematics of operations research"},{"key":"7010_CR12","doi-asserted-by":"crossref","unstructured":"Fernandez-Viagas, V., & Framinan, J. M. (2015a). Controllable processing times in project and production management: Analysing the trade-off between processing times and the amount of resources. Mathematical Problems in Engineering 2015.","DOI":"10.1155\/2015\/826318"},{"key":"7010_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, J. M. (2015b). Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Computers & Operations Research,60, 27\u201336.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"7010_CR14","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.3934\/jimo.2014.10.1071","volume":"10","author":"P Guo","year":"2014","unstructured":"Guo, P., Cheng, W., & Wang, Y. (2014). A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. Journal of Industrial & Management Optimization,10(4), 1071\u20131090.","journal-title":"Journal of Industrial & Management Optimization"},{"issue":"11","key":"7010_CR15","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1080\/01605682.2021.1999182","volume":"73","author":"Y Jiang","year":"2021","unstructured":"Jiang, Y., Zhang, Z., Song, X., & Yin, Y. (2021). Scheduling controllable processing time jobs in seru production system with resource allocation. Journal of the Operational Research Society,73(11), 2551\u20132571.","journal-title":"Journal of the Operational Research Society"},{"key":"7010_CR16","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. Computers & Industrial Engineering,98, 300\u2013307.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"7010_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.cie.2011.08.019","volume":"65","author":"V Kayvanfar","year":"2013","unstructured":"Kayvanfar, V., Mahdavi, I., & Komaki, G. M. (2013). Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering,65(1), 166\u2013175.","journal-title":"Computers & Industrial Engineering"},{"key":"7010_CR18","unstructured":"Kim, H. J., Kim, E. S., Lee, J. H., Tang, L., & Yang, Y. (2021) Single-machine scheduling with energy generation and storage systems. International Journal of Production Research, 1\u201320."},{"key":"7010_CR19","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":"7010_CR20","doi-asserted-by":"publisher","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 and Evolutionary Computation,67, Article 100973.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"7010_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/07408170903394322","volume":"42","author":"Y Leyvand","year":"2009","unstructured":"Leyvand, Y., Shabtay, D., & Steiner, G. (2009). Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times. IIE Transactions,42(3), 221\u2013231.","journal-title":"IIE Transactions"},{"issue":"19","key":"7010_CR22","doi-asserted-by":"publisher","first-page":"5381","DOI":"10.3390\/su11195381","volume":"11","author":"Y Liu","year":"2019","unstructured":"Liu, Y., Liao, X., & Zhang, R. (2019). An enhanced mopso algorithm for energy-efficient single-machine production scheduling. Sustainability,11(19), 5381.","journal-title":"Sustainability"},{"key":"7010_CR23","doi-asserted-by":"crossref","unstructured":"Maciel, I. S. F., Prata, B. d. A., Nagano, M. S., & Abreu, L. R. d. (2022). A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times. Journal of Project Management.","DOI":"10.5267\/j.jpm.2022.5.002"},{"issue":"7","key":"7010_CR24","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/s00170-003-1864-y","volume":"25","author":"R Maheswaran","year":"2005","unstructured":"Maheswaran, R., Ponnambalam, S., & Aravindan, C. (2005). A meta-heuristic approach to single machine scheduling problems. The International Journal of Advanced Manufacturing Technology,25(7), 772\u2013776.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"7010_CR25","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 Journal of Operational Research.","DOI":"10.1016\/j.ejor.2020.02.010"},{"key":"7010_CR26","unstructured":"Montgomery, D. C. (2017). Design and analysis of experiments. Wiley."},{"issue":"2","key":"7010_CR27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/19397030802257236","volume":"1","author":"G Mouzon","year":"2008","unstructured":"Mouzon, G., & Yildirim, M. B. (2008). A framework to minimise total energy consumption and total tardiness on a single machine. International Journal of Sustainable Engineering,1(2), 105\u2013116.","journal-title":"International Journal of Sustainable Engineering"},{"issue":"18\u201319","key":"7010_CR28","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1080\/00207540701450013","volume":"45","author":"G Mouzon","year":"2007","unstructured":"Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of production research,45(18\u201319), 4247\u20134271.","journal-title":"International Journal of production research"},{"key":"7010_CR29","doi-asserted-by":"crossref","unstructured":"Naderi, B., Ruiz, R., & Roshanaei, V. (2023). Mixed-integer programming vs. constraint programming for shop scheduling problems: new results and outlook. INFORMS Journal on Computing,35(4), 817\u2013843.","DOI":"10.1287\/ijoc.2023.1287"},{"key":"7010_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ijpe.2015.12.014","volume":"173","author":"D Oron","year":"2016","unstructured":"Oron, D. (2016). Scheduling controllable processing time jobs with position-dependent workloads. International Journal of Production Economics,173, 153\u2013160.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"7010_CR31","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D Pisinger","year":"1995","unstructured":"Pisinger, D. (1995). A minimal algorithm for the multiple-choice knapsack problem. European Journal of Operational Research,83(2), 394\u2013410.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"7010_CR32","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/s11750-020-00574-x","volume":"29","author":"BA Prata","year":"2021","unstructured":"Prata, B. A., de Abreu, L. R., & Lima, J. Y. F. (2021). Heuristic methods for the single-machine scheduling problem with periodical resource constraints. Top,29(2), 524\u2013546.","journal-title":"Top"},{"issue":"2","key":"7010_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.25077\/josi.v21.n2.p97-105.2022","volume":"21","author":"B Prata","year":"2022","unstructured":"Prata, B., Abreu, L. R., Nagano, M. S., et al. (2022). Total tardiness minimization in a single-machine with periodical resource constraints. Jurnal Optimasi Sistem Industri,21(2), 97\u2013105.","journal-title":"Jurnal Optimasi Sistem Industri"},{"key":"7010_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.rico.2023.100350","volume":"14","author":"BA Prata","year":"2024","unstructured":"Prata, B. A., Abreu, L. R., & Nagano, M. S. (2024). Applications of constraint programming in production scheduling problems: A descriptive bibliometric analysis. Results in Control and Optimization,14, Article 100350.","journal-title":"Results in Control and Optimization"},{"key":"7010_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105880","volume":"145","author":"BA Prata","year":"2022","unstructured":"Prata, B. A., Fernandez-Viagas, V., Framinan, J. M., & Rodrigues, C. D. (2022). Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Computers & Operations Research,145, Article 105880.","journal-title":"Computers & Operations Research"},{"key":"7010_CR36","doi-asserted-by":"crossref","unstructured":"Qiao, D., Wang, Y., Pei, J., Bai, W., & Wen, X. (2021). Research on green single machine scheduling based on improved ant colony algorithm. Measurement and Control, pp. 00202940211064243.","DOI":"10.1177\/00202940211064243"},{"key":"7010_CR37","unstructured":"Rossi, F., Van\u00a0Beek, P., & Walsh, T. (2006). Handbook of constraint programming. Elsevier."},{"issue":"2","key":"7010_CR38","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/0377-2217(96)00041-0","volume":"93","author":"I Sabuncuoglu","year":"1996","unstructured":"Sabuncuoglu, I., & Gurgun, B. (1996). A neural network model for scheduling problems. European Journal of Operational Research,93(2), 288\u2013299.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"7010_CR39","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2021.03.034","volume":"296","author":"D Shabtay","year":"2022","unstructured":"Shabtay, D. (2022). Single-machine scheduling with machine unavailability periods and resource dependent processing times. European Journal of Operational Research,296(2), 423\u2013439.","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"7010_CR40","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. Discrete Applied Mathematics,155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"7010_CR41","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ijpe.2017.12.025","volume":"198","author":"D Shabtay","year":"2018","unstructured":"Shabtay, D., & Zofi, M. (2018). Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan. International Journal of Production Economics,198, 191\u2013200.","journal-title":"International Journal of Production Economics"},{"key":"7010_CR42","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ijpe.2013.12.021","volume":"150","author":"DL Yang","year":"2014","unstructured":"Yang, D. L., Lai, C. J., & Yang, S. J. (2014). Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. International Journal of Production Economics,150, 96\u2013103.","journal-title":"International Journal of Production Economics"},{"key":"7010_CR43","doi-asserted-by":"crossref","unstructured":"Zheng, F., Wang, Z., Xu, Y., & Liu, M. (2023). Single machine scheduling with uncertain processing times and carbon emission constraint in the shared manufacturing environment. Annals of Operations Research, 1\u201331.","DOI":"10.1007\/s10479-023-05610-0"},{"issue":"7","key":"7010_CR44","doi-asserted-by":"publisher","first-page":"5371","DOI":"10.1016\/j.apm.2012.09.072","volume":"37","author":"Z Zhu","year":"2013","unstructured":"Zhu, Z., Chu, F., Sun, L., & Liu, M. (2013). Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity. Applied Mathematical Modelling,37(7), 5371\u20135380.","journal-title":"Applied Mathematical Modelling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-07010-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-07010-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-07010-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T09:29:32Z","timestamp":1770197372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-07010-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":44,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["7010"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-07010-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"14 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2026","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"}}]}}