{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T06:16:36Z","timestamp":1772172996695,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T00:00:00Z","timestamp":1738800000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T00:00:00Z","timestamp":1738800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["884\/22"],"award-info":[{"award-number":["884\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013043","name":"Ariel University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100013043","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We study scheduling problems on <jats:italic>parallel dedicated<\/jats:italic> machines and assume that a specific job can only be processed on one specific machine. We concentrate on solving scheduling problems involving <jats:italic>convex resource allocation<\/jats:italic> and address three of the most fundamental measures in scheduling theory, i.e., makespan, total load, and total weighted completion time. Firstly, we focus on <jats:italic>position-independent workloads,<\/jats:italic> and then we study the setting of <jats:italic>general position-dependent workloads<\/jats:italic>, i.e., the workloads are not restricted to be either monotone functions of the job positions or any specific functions. In all problems, we assume a common <jats:italic>continuous<\/jats:italic> and <jats:italic>non-renewable<\/jats:italic> (limited) resource and adapt known results from scheduling theory to solve the considered problems.<\/jats:p>","DOI":"10.1007\/s10479-025-06471-5","type":"journal-article","created":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T15:09:46Z","timestamp":1738854586000},"page":"2173-2193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling problems on parallel dedicated machines with non-renewable resource"],"prefix":"10.1007","volume":"346","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2120-2595","authenticated-orcid":false,"given":"Joanna","family":"Berli\u0144ska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,6]]},"reference":[{"issue":"4","key":"6471_CR1","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56(4), 1642\u20131661.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"6471_CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/nav.21846","volume":"66","author":"TC Cheng","year":"2019","unstructured":"Cheng, T. C., Kravchenko, S. A., & Lin, B. M. (2019). Server scheduling on parallel dedicated machines with fixed job sequences. Naval Research Logistics, 66(4), 321\u2013332.","journal-title":"Naval Research Logistics"},{"issue":"10","key":"6471_CR3","doi-asserted-by":"crossref","first-page":"2286","DOI":"10.1080\/01605682.2020.1779625","volume":"72","author":"TC Cheng","year":"2021","unstructured":"Cheng, T. C., Kravchenko, S. A., & Lin, B. M. (2021). Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences. Journal of the Operational Research Society, 72(10), 2286\u20132289.","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"6471_CR4","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1504\/IJADS.2022.126104","volume":"15","author":"YE Demirtas","year":"2022","unstructured":"Demirtas, Y. E. (2022). Unrelated parallel dedicated machine scheduling with sequence dependent setup times: An application in a textile company. International Journal of Applied Decision Sciences, 15(6), 733\u2013752.","journal-title":"International Journal of Applied Decision Sciences"},{"key":"6471_CR5","doi-asserted-by":"crossref","unstructured":"Dlamini, N. Z., Mpofu, K., Daniyan, I., & Ramatsetse, B. (2023). An overview of the manufacturing systems: A literature survey. In Smart, sustainable manufacturing in an ever-changing world: proceedings of international conference on competitive manufacturing (pp. 905\u2013927). Springer.","DOI":"10.1007\/978-3-031-15602-1_64"},{"key":"6471_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz, S. (2020). Models and algorithms of time-dependent scheduling. Springer."},{"issue":"8","key":"6471_CR7","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","volume":"51","author":"X Geng","year":"2019","unstructured":"Geng, X., Wang, J., & Bai, D. (2019). Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Engineering Optimization, 51(8), 1301\u20131323.","journal-title":"Engineering Optimization"},{"issue":"7","key":"6471_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.3390\/computation11070137","volume":"11","author":"MK Hajji","year":"2023","unstructured":"Hajji, M. K., Hadda, H., & Dridi, N. (2023). Makespan minimization for the two-stage hybrid flow shop problem with dedicated machines: A comprehensive study of exact and heuristic approaches. Computation, 11(7), 137.","journal-title":"Computation"},{"key":"6471_CR9","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.procs.2020.09.043","volume":"176","author":"H Harbaoui","year":"2020","unstructured":"Harbaoui, H., & Khalfallah, S. (2020). Tabu-search optimization approach for no-wait hybrid flow-shop scheduling with dedicated machines. Procedia Computer Science, 176, 706\u2013712.","journal-title":"Procedia Computer Science"},{"issue":"10","key":"6471_CR10","doi-asserted-by":"crossref","first-page":"1594","DOI":"10.1016\/j.ifacol.2022.09.618","volume":"55","author":"J Hoffmann","year":"2022","unstructured":"Hoffmann, J., Neufeld, J. S., & Buscher, U. (2022). Iterated greedy algorithms for customer order scheduling with dedicated machines. IFAC-PapersOnLine, 55(10), 1594\u20131599.","journal-title":"IFAC-PapersOnLine"},{"issue":"9","key":"6471_CR11","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1016\/S0305-0548(03)00103-5","volume":"31","author":"M Kaspi","year":"2004","unstructured":"Kaspi, M., & Shabtay, D. (2004). Convex resource allocation for minimizing the makespan in a single machine with job release dates. Computers & Operations Research, 31(9), 1481\u20131489.","journal-title":"Computers & Operations Research"},{"key":"6471_CR12","volume":"126","author":"HJ Kim","year":"2021","unstructured":"Kim, H. J., & Lee, J. H. (2021). Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers. Computers & Operations Research, 126, 105115.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6471_CR13","doi-asserted-by":"crossref","first-page":"2920","DOI":"10.3390\/su15042920","volume":"15","author":"A Lee","year":"2023","unstructured":"Lee, A., Kang, H., Lee, D., Lee, J., & Kim, K. (2023). Deep reinforcement learning-based scheduler on parallel dedicated machine scheduling problem towards minimizing total tardiness. Sustainability, 15(4), 2920.","journal-title":"Sustainability"},{"issue":"24","key":"6471_CR14","doi-asserted-by":"crossref","first-page":"7137","DOI":"10.3390\/su11247137","volume":"11","author":"JH Lee","year":"2019","unstructured":"Lee, J. H., & Jang, H. (2019). Uniform parallel machine scheduling with dedicated machines, job splitting and setup resources. Sustainability, 11(24), 7137.","journal-title":"Sustainability"},{"issue":"7","key":"6471_CR15","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1080\/0305215X.2019.1638920","volume":"52","author":"X Liang","year":"2020","unstructured":"Liang, X., Liu, M., Feng, Y., Wang, J., & Wen, L. (2020). Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology. Engineering Optimization, 52(7), 1184\u20131197.","journal-title":"Engineering Optimization"},{"issue":"1","key":"6471_CR16","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1080\/0305215X.2019.1580705","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu, W., & Jiang, C. (2020). Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Engineering Optimization, 52(1), 74\u201389.","journal-title":"Engineering Optimization"},{"issue":"10","key":"6471_CR17","doi-asserted-by":"crossref","first-page":"1810","DOI":"10.1080\/0305215X.2017.1414207","volume":"50","author":"Y Lu","year":"2018","unstructured":"Lu, Y., & Liu, J. (2018). A note on resource allocation scheduling with position-dependent workloads. Engineering Optimization, 50(10), 1810\u20131827.","journal-title":"Engineering Optimization"},{"issue":"7","key":"6471_CR18","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1080\/0305215X.2020.1773813","volume":"53","author":"Y Lu","year":"2021","unstructured":"Lu, Y., Wang, T., Wang, R., & Li, Y. (2021). A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation. Engineering Optimization, 53(7), 1273\u20131281.","journal-title":"Engineering Optimization"},{"key":"6471_CR19","doi-asserted-by":"crossref","unstructured":"Luo, C., & Zhang, G. (2020). Single machine scheduling problem with controllable setup and job processing times and position-dependent workloads. In IOP conference series: Materials science and engineering (p. 012093). IOP Publishing.","DOI":"10.1088\/1757-899X\/790\/1\/012093"},{"key":"6471_CR20","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2021.107209","volume":"159","author":"I M\u00f3dos","year":"2021","unstructured":"M\u00f3dos, I., \u0160ucha, P., & Hanz\u00e1lek, Z. (2021). On parallel dedicated machines scheduling under energy consumption limit. Computers & Industrial Engineering, 159, 107209.","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"6471_CR21","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1080\/0305215X.2018.1519557","volume":"51","author":"B Mor","year":"2019","unstructured":"Mor, B. (2019). Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation. Engineering Optimization, 51(7), 1251\u20131267.","journal-title":"Engineering Optimization"},{"key":"6471_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-020-1946-6","author":"B Mor","year":"2020","unstructured":"Mor, B. (2020). A unified approach for single machine scheduling with position-dependent workloads and positional penalties. SN Applied Sciences. https:\/\/doi.org\/10.1007\/s42452-020-1946-6","journal-title":"SN Applied Sciences"},{"issue":"1","key":"6471_CR23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10878-021-00746-w","volume":"43","author":"B Mor","year":"2022","unstructured":"Mor, B. (2022). Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. Journal of Combinatorial Optimization, 43(1), 79\u201397.","journal-title":"Journal of Combinatorial Optimization"},{"key":"6471_CR24","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1007\/s10479-018-2779-1","volume":"271","author":"B Mor","year":"2018","unstructured":"Mor, B., & Mosheiov, G. (2018). A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Annals of Operations Research, 271, 1079\u20131085.","journal-title":"Annals of Operations Research"},{"issue":"19","key":"6471_CR25","doi-asserted-by":"publisher","first-page":"6933","DOI":"10.1080\/00207543.2024.2314714","volume":"62","author":"B Mor","year":"2024","unstructured":"Mor, B., & Mosheiov, G. (2024). Scheduling on parallel dedicated machines with job rejection. International Journal of Production Research, 62(19), 6933\u20136940. https:\/\/doi.org\/10.1080\/00207543.2024.2314714","journal-title":"International Journal of Production Research"},{"key":"6471_CR26","volume":"153","author":"B Mor","year":"2021","unstructured":"Mor, B., Shabtay, D., & Yedidsion, L. (2021). Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Computers & Industrial Engineering, 153, 107024.","journal-title":"Computers & Industrial Engineering"},{"key":"6471_CR27","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.dam.2021.01.013","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., Oron, D., & Salehipour, A. (2021). Coupled task scheduling with convex resource consumption functions. Discrete Applied Mathematics, 293, 128\u2013133.","journal-title":"Discrete Applied Mathematics"},{"key":"6471_CR28","doi-asserted-by":"crossref","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":"6471_CR29","doi-asserted-by":"crossref","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":"6471_CR30","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1016\/S0305-0548(03)00187-4","volume":"31","author":"D Shabtay","year":"2004","unstructured":"Shabtay, D., & Kaspi, M. (2004). Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & Operations Research, 31(13), 2279\u20132289.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"6471_CR31","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ejor.2004.12.008","volume":"173","author":"D Shabtay","year":"2006","unstructured":"Shabtay, D., & Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173(1), 92\u2013107.","journal-title":"European Journal of Operational Research"},{"issue":"13","key":"6471_CR32","doi-asserted-by":"crossref","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":"6471_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-39574-6","volume-title":"Scheduling with time-changing effects and rate-modifying activities","author":"VA Strusevich","year":"2017","unstructured":"Strusevich, V. A., & Rustogi, K. (2017). Scheduling with time-changing effects and rate-modifying activities. Springer."},{"issue":"6","key":"6471_CR34","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1080\/00207543.2018.1510559","volume":"57","author":"X Sun","year":"2019","unstructured":"Sun, X., Geng, X., Wang, J., & Liu, F. (2019). Convex resource allocation scheduling in the no-wait flowshop with common flow allowance and learning effect. International Journal of Production Research, 57(6), 1873\u20131891.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"6471_CR35","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.3934\/jimo.2022011","volume":"19","author":"JB Wang","year":"2023","unstructured":"Wang, J. B., Lv, D., Wang, S., & Jiang, C. (2023). Resource allocation scheduling with deteriorating jobs and position-dependent workloads. Journal of Industrial and Management Optimization, 19(3), 1658\u20131669.","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"3","key":"6471_CR36","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1111\/itor.12888","volume":"28","author":"JB Wang","year":"2021","unstructured":"Wang, J. B., Lv, D. Y., Xu, J., Ji, P., & Li, F. (2021). Bicriterion scheduling with truncated learning effects and convex controllable processing times. International Transactions in Operational Research, 28(3), 1573\u20131593.","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"6471_CR37","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/j.cor.2011.05.026","volume":"39","author":"JB Wang","year":"2012","unstructured":"Wang, J. B., & Wang, M. Z. (2012). Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Computers & Operations Research, 39(3), 492\u2013497.","journal-title":"Computers & Operations Research"},{"issue":"14","key":"6471_CR38","doi-asserted-by":"crossref","first-page":"3179","DOI":"10.3390\/math11143179","volume":"11","author":"YC Wang","year":"2023","unstructured":"Wang, Y. C., & Wang, J. B. (2023). Study on convex resource allocation scheduling with a time-dependent learning effect. Mathematics, 11(14), 3179.","journal-title":"Mathematics"},{"key":"6471_CR39","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595921500469","author":"X Zhao","year":"2022","unstructured":"Zhao, X., Xu, J., Wang, J., & Li, L. (2022). Bicriteria common flow allowance scheduling with aging effect, convex resource allocation, and a rate-modifying activity on a single machine. Asia-Pacific Journal of Operational Research. https:\/\/doi.org\/10.1142\/S0217595921500469","journal-title":"Asia-Pacific Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06471-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06471-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T20:10:53Z","timestamp":1743192653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06471-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,6]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["6471"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06471-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,6]]},"assertion":[{"value":"9 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 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 report there are no competing interests to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}