{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T19:16:19Z","timestamp":1778526979335,"version":"3.51.4"},"reference-count":49,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T00:00:00Z","timestamp":1726963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Science Research Foundation of Educational Department of Liaoning Province","award":["JYTMS20230278"],"award-info":[{"award-number":["JYTMS20230278"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,1,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This article addresses two scheduling problems with resource allocations and learning effects on a single machine, meaning the actual processing time of a job is a nonincreasing and continuous function of the total job parameter relating to the processed jobs and the amount of resource allocation. Our first problem is to find a job sequence and resource allocations that lead to a minimization of the weighted sum of total completion-time cost and total resource-consumption cost. The second problem is to minimize the total completion-time cost subject to the total resource-consumption cost is bounded. For a special case, we prove that both these problems are polynomially solvable. Generally, we propose some heuristic algorithms and a branch-and-bound algorithm to solve the problems.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae095","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:27:51Z","timestamp":1725586071000},"page":"97-108","source":"Crossref","is-referenced-by-count":8,"title":["Research on convex resource allocation scheduling with exponential time-dependent learning effects"],"prefix":"10.1093","volume":"68","author":[{"given":"Li-Han","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mechatronics Engineering , Shenyang Aerospace University, Shenyang 110136, P. R.","place":["China"]},{"name":"Laboratory of Rapid Development & Manufacturing Technology for Aircraft (Shenyang Aerospace University) , Ministry of Education, Shenyang 110136, P. R.","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu-Han","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mechatronics Engineering, Shenyang Aerospace University , Shenyang 110136, P. R.","place":["China"]},{"name":"Laboratory of Rapid Development & Manufacturing Technology for Aircraft (Shenyang Aerospace University) , Ministry of Education, Shenyang 110136, P. R.","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Mechatronics Engineering, Shenyang Aerospace University , Shenyang 110136, P. R.","place":["China"]},{"name":"Laboratory of Rapid Development & Manufacturing Technology for Aircraft (Shenyang Aerospace University) , Ministry of Education, Shenyang 110136, P. R.","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mechatronics Engineering, Shenyang Aerospace University , Shenyang 110136, P. R.","place":["China"]},{"name":"Laboratory of Rapid Development & Manufacturing Technology for Aircraft (Shenyang Aerospace University) , Ministry of Education, Shenyang 110136, P. R.","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,9,22]]},"reference":[{"key":"2025012013012937300_ref1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.2514\/8.155","article-title":"Factors affecting the cost of airplanes","volume":"3","author":"Wright","year":"1936","journal-title":"J. Aeronaut. Sci."},{"key":"2025012013012937300_ref2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","article-title":"A note on scheduling on a single processor with speed dependent on a number of executed jobs","volume":"57","author":"Gawiejnowicz","year":"1996","journal-title":"Inf. Process. Lett."},{"key":"2025012013012937300_ref3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1057\/jors.2011.40","article-title":"Worst-case analysis for flow shop scheduling problems with an exponential learning effect","volume":"63","author":"Wang","year":"2012","journal-title":"J. Oper. Res. Soc."},{"key":"2025012013012937300_ref4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jmsy.2014.11.001","article-title":"Single machine scheduling problems with exponentially time-dependent learning effects","volume":"34","author":"Cheng","year":"2015","journal-title":"J. Manuf. Syst."},{"key":"2025012013012937300_ref5","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","article-title":"A survey of scheduling with controllable processing times","volume":"155","author":"Shabtay","year":"2007","journal-title":"Discret. Appl. Math."},{"key":"2025012013012937300_ref6","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.cor.2011.05.026","article-title":"Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time","volume":"39","author":"Wang","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"2025012013012937300_ref7","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1111\/itor.12121","article-title":"Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity","volume":"22","author":"Ji","year":"2015","journal-title":"Int. Trans. Oper. Res."},{"key":"2025012013012937300_ref8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/nav.21731","article-title":"A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times","volume":"64","author":"Wang","year":"2017","journal-title":"Nav. Res. Logist."},{"key":"2025012013012937300_ref9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ins.2018.11.023","article-title":"Bicriterion scheduling with a negotiable common due window and resource-dependent processing times","volume":"478","author":"Wang","year":"2019","journal-title":"Inform. Sci."},{"key":"2025012013012937300_ref10","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1093\/comjnl\/bxx120","article-title":"Scheduling jobs with resource-dependent ready times and processing times depending on their starting times and positions","volume":"61","author":"Jin","year":"2018","journal-title":"Comp. J."},{"key":"2025012013012937300_ref11","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1080\/0305215X.2017.1414207","article-title":"A note on resource allocation scheduling with position-dependent workloads","volume":"50","author":"Lu","year":"2018","journal-title":"Eng. Optim."},{"key":"2025012013012937300_ref12","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1080\/01605682.2023.2244529","article-title":"Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives","volume":"75","author":"Kovalev","year":"2024","journal-title":"J. Oper. Res. Soc."},{"key":"2025012013012937300_ref13","first-page":"124543","article-title":"Tri-criteria single machine scheduling model with release times and learning factor","volume":"387","author":"Qian","year":"2020","journal-title":"Appl. Math Comput."},{"key":"2025012013012937300_ref14","doi-asserted-by":"publisher","first-page":"107309","DOI":"10.1016\/j.cie.2021.107309","article-title":"Minimization of maximum lateness in a flowshop learning effect scheduling with release dates","volume":"158","author":"Bai","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"2025012013012937300_ref15","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","article-title":"Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time","volume":"72","author":"Sun","year":"2021","journal-title":"J. Oper. Res. Soc."},{"key":"2025012013012937300_ref16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s40314-022-01851-0","article-title":"Scheduling jobs with general truncated learning effects including proportional setup times","volume":"41","author":"Zhao","year":"2022","journal-title":"Comput. Appl. Math."},{"key":"2025012013012937300_ref17","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1093\/comjnl\/bxab201","article-title":"Some scheduling problems with job rejection and a learning effect","volume":"66","author":"Toksari","year":"2023","journal-title":"Comp. J."},{"key":"2025012013012937300_ref18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s40314-024-02717-3","article-title":"Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times","volume":"43","author":"Wang","year":"2024","journal-title":"Comput. Appl. Math."},{"key":"2025012013012937300_ref19","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1007\/s12190-024-02080-w","article-title":"Permutation flow shop scheduling with makespan objective and truncated learning effects","volume":"70","author":"Li","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"2025012013012937300_ref20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/0305215X.2024.2372633","article-title":"Research on two-machine flow shop scheduling problem with release dates and truncated learning effects","author":"Lv","year":"2024","journal-title":"Eng. Optim."},{"key":"2025012013012937300_ref21","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","article-title":"Scheduling problems under learning effects: Classification and cartography","volume":"56","author":"Azzouz","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"2025012013012937300_ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling","author":"Agnetis","year":"2014"},{"key":"2025012013012937300_ref23","volume-title":"Handbook on Scheduling","author":"Blazewicz","year":"2019"},{"key":"2025012013012937300_ref24","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.cie.2010.06.002","article-title":"Single-machine scheduling with learning effect and resource dependent processing times","volume":"59","author":"Wang","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"2025012013012937300_ref25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11590-012-0467-7","article-title":"Optimal due-date assignment problem with learning effect and resource-dependent processing times","volume":"8","author":"Lu","year":"2014","journal-title":"Optim. Lett."},{"key":"2025012013012937300_ref26","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1093\/comjnl\/bxx121","article-title":"Single machine CON\/SLK due date assignment scheduling with controllable processing time and job-dependent learning effects","volume":"61","author":"Wang","year":"2018","journal-title":"Comp. J."},{"key":"2025012013012937300_ref27","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1080\/0305215X.2016.1265305","article-title":"A note on resource allocation scheduling with group technology and learning effects on a single machine","volume":"49","author":"Lu","year":"2017","journal-title":"Eng. Optim."},{"key":"2025012013012937300_ref28","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.3934\/jimo.2022091","article-title":"Study on resource allocation scheduling problem with learning factors and group technology","volume":"19","author":"Yan","year":"2023","journal-title":"J. Ind. Manag. Optim."},{"key":"2025012013012937300_ref29","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","article-title":"Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect","volume":"51","author":"Geng","year":"2019","journal-title":"Eng. Optim."},{"key":"2025012013012937300_ref30","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1093\/comjnl\/bxy034","article-title":"No-wait resource allocation flowshop scheduling with learning effect under limited cost availability","volume":"62","author":"Tian","year":"2019","journal-title":"Comp. J."},{"key":"2025012013012937300_ref31","doi-asserted-by":"publisher","first-page":"2817","DOI":"10.3934\/jimo.2020096","article-title":"Resource allocation flowshop scheduling with learning effect and slack due window assignment","volume":"17","author":"Zhao","year":"2021","journal-title":"J. Ind. Manag. Optim."},{"key":"2025012013012937300_ref32","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1111\/itor.12888","article-title":"Bicriterion scheduling with truncated learning effects and convex controllable processing times","volume":"28","author":"Wang","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"key":"2025012013012937300_ref33","doi-asserted-by":"publisher","first-page":"3179","DOI":"10.3390\/math11143179","article-title":"Study on convex resource allocation scheduling with a time-dependent learning effect","volume":"11","author":"Wang","year":"2023","journal-title":"Mathematics"},{"key":"2025012013012937300_ref34","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.3390\/math12071029","article-title":"Scheduling with group technology, resource allocation, and learning effect simultaneously","volume":"12","author":"Li","year":"2024","journal-title":"Mathematics"},{"key":"2025012013012937300_ref35","first-page":"9","article-title":"Single machine scheduling problems with learning effect and resource-dependence","volume":"33","author":"Yu","year":"2016","journal-title":"J. Chongqing Norm. Univ. (Nat. Sci.)"},{"key":"2025012013012937300_ref36","first-page":"24","article-title":"Study on single machine scheduling problems with exponential learning effects and convex resource allocation","volume":"39","author":"Yang","year":"2022","journal-title":"J. Chongqing Norm. Univ. (Nat. Sci.)"},{"key":"2025012013012937300_ref37","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1080\/05695556908974435","article-title":"On start-up or learning curves: An expanded view","volume":"1","author":"Pegels","year":"1969","journal-title":"AIIE Trans."},{"key":"2025012013012937300_ref38","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jmsy.2011.03.004","article-title":"Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times","volume":"30","author":"Wu","year":"2011","journal-title":"J. Manuf. Syst."},{"key":"2025012013012937300_ref39","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/09511929208944543","article-title":"Annealing method for PCB assembly scheduling on two sequential machines","volume":"5","author":"Ben-Arieh","year":"1992","journal-title":"Int. J. Comp. Integr. Manuf."},{"key":"2025012013012937300_ref40","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1002\/hfm.20365","article-title":"A truncated sum of processing-times-based learning model for a two-machine flowshop scheduling problem","volume":"24","author":"Lai","year":"2014","journal-title":"Hum. Factors Ergon. Manuf. Serv. Ind."},{"key":"2025012013012937300_ref41","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ins.2013.08.030","article-title":"A single-machine scheduling with a truncated linear deterioration and ready times","volume":"256","author":"Wu","year":"2014","journal-title":"Inform. Sci."},{"key":"2025012013012937300_ref42","doi-asserted-by":"publisher","first-page":"610","DOI":"10.3390\/math12040610","article-title":"Single machine scheduling proportionally deteriorating jobs with ready times subject to the total weighted completion time minimization","volume":"12","author":"Lv","year":"2024","journal-title":"Mathematics"},{"key":"2025012013012937300_ref43","doi-asserted-by":"publisher","first-page":"2350026","DOI":"10.1142\/S0217595923500264","article-title":"Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs","volume":"41","author":"Wang","year":"2024","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2025012013012937300_ref44","doi-asserted-by":"publisher","first-page":"2285","DOI":"10.1007\/s12190-024-02052-0","article-title":"Supply chain scheduling with deteriorating jobs and delivery times","volume":"70","author":"Mao","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"2025012013012937300_ref45","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.3934\/jimo.2023136","article-title":"Single machine slack due window assignment and deteriorating jobs","volume":"20","author":"Zhang","year":"2024","journal-title":"J. Ind. Manag. Optim."},{"key":"2025012013012937300_ref46","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595924500118","article-title":"Research on multiple slack due-date assignments scheduling with position-dependent weights","author":"Wang","year":"2024","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2025012013012937300_ref47","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595924500039","article-title":"No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines","author":"Lv","year":"2024","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2025012013012937300_ref48","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1007\/s12190-024-02023-5","article-title":"Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations","volume":"70","author":"Qian","year":"2024","journal-title":"J. Appl. Math. Comput."},{"key":"2025012013012937300_ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109317","article-title":"Scheduling on proportionate flow shop with job rejection and common due date assignment","volume":"181","author":"Geng","year":"2023","journal-title":"Comput. Ind. Eng."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/1\/97\/59225923\/bxae095.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/1\/97\/59225923\/bxae095.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:01:38Z","timestamp":1737378098000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/1\/97\/7764031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,22]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,9,22]]},"published-print":{"date-parts":[[2025,1,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae095","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,1]]},"published":{"date-parts":[[2024,9,22]]}}}