{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:46Z","timestamp":1759063546150,"version":"3.37.3"},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T00:00:00Z","timestamp":1521849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71471120","71501082"],"award-info":[{"award-number":["71471120","71501082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007933","name":"Liaoning University","doi-asserted-by":"publisher","award":["LR2016017"],"award-info":[{"award-number":["LR2016017"]}],"id":[{"id":"10.13039\/501100007933","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Liaoning Province Universities and Colleges Basic Scientific Research Project of Youth Project","award":["LQN2017ST04"],"award-info":[{"award-number":["LQN2017ST04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1093\/comjnl\/bxy030","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T12:21:30Z","timestamp":1519906890000},"page":"81-89","source":"Crossref","is-referenced-by-count":3,"title":["Single-machine scheduling with simultaneous considerations of resource allocation and deteriorating jobs"],"prefix":"10.1093","volume":"62","author":[{"given":"Weiwei","family":"Liu","sequence":"first","affiliation":[{"name":"School of Management and Journalism and Communications, Shenyang Sport University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Management and Journalism and Communications, Shenyang Sport University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan-Yuan","family":"Lu","sequence":"additional","affiliation":[{"name":"College of Mathematics, Jilin Normal University, Siping, Jilin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,3,24]]},"reference":[{"key":"key\n\t\t\t\t2019011011280038900_bxy030C1","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/S1052623495288192","article-title":"Bicriterion single machine scheduling with resource dependent processing times","volume":"8","author":"Cheng","year":"1998","journal-title":"SIAM J. Optim."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1018943300630","article-title":"A permutation flow-shop scheduling problem with convex models of operation processing times","volume":"96","author":"Cheng","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10479-011-0923-2","article-title":"Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects","volume":"191","author":"Wang","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10479-012-1288-x","article-title":"Single machine total tardiness maximization problems: complexity and algorithms","volume":"207","author":"Gafarov","year":"2013","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C5","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s10479-013-1364-x","article-title":"Strong NP-hardness of scheduling problems with learning or aging effect","volume":"206","author":"Janiak","year":"2013","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","article-title":"Makespan minimization in online scheduling with machine eligibility","volume":"204","author":"Lee","year":"2013","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C7","article-title":"A multi-machine order scheduling with learning using the genetic algorithm and particle swarm optimization","author":"Wu","year":"2017","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C8","article-title":"Single machine total absolute differences penalties minimization scheduling with a deteriorating and resource-dependent maintenance activity","author":"Wang","year":"2017","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-Dependent Scheduling","author":"Gawiejnowicz","year":"2008"},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C10","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.cie.2010.06.017","article-title":"Minimizing the number of tardy jobs under piecewise-linear deterioration","volume":"59","author":"Moslehi","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C11","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1057\/jors.2010.120","article-title":"Scheduling jobs with chain precedence constraints and deteriorating jobs","volume":"62","author":"Wang","year":"2011","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s11590-010-0253-3","article-title":"Single-machine scheduling with nonlinear deterioration","volume":"6","author":"Wang","year":"2012","journal-title":"Optim. Lett."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C13","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.cor.2012.08.006","article-title":"Minimizing makespan in three-machine flow shops with deteriorating jobs","volume":"40","author":"Wang","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C14","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.ins.2014.02.034","article-title":"Single machine group scheduling with time dependent processing times and ready times","volume":"275","author":"Wang","year":"2014","journal-title":"Inf. Sci."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C15","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1093\/comjnl\/bxx007","article-title":"An investigation of single-machine due-window assignment with time-dependent processing times and a controllable rate-modifying activity","volume":"60","author":"Zhao","year":"2017","journal-title":"Comput. J."},{"issue":"1","key":"key\n\t\t\t\t2019011011280038900_bxy030C16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1093\/comjnl\/bxx032","article-title":"Machine scheduling with deteriorating jobs and modifying maintenance activities","volume":"61","author":"Wang","year":"2018","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C17","doi-asserted-by":"crossref","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":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10479-007-0269-y","article-title":"The single machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times","volume":"159","author":"Shabtay","year":"2008","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C19","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1016\/j.cor.2008.05.009","article-title":"Minimizing total tardiness on a single machine with controllable processing times","volume":"36","author":"Tseng","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C20","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10479-010-0827-6","article-title":"Single machine scheduling with total tardiness criterion and convex controllable processing times","volume":"186","author":"Xu","year":"2011","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10878-009-9270-5","article-title":"Just-in-time scheduling with controllable processing times on parallel machines","volume":"19","author":"Leyvand","year":"2010","journal-title":"J. Comb. Optim."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C22","doi-asserted-by":"crossref","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":"key\n\t\t\t\t2019011011280038900_bxy030C23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cie.2011.08.019","article-title":"Single machine scheduling with controllable processing times to minimize total tardiness and earliness","volume":"65","author":"Kayvanfar","year":"2013","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C24","doi-asserted-by":"crossref","first-page":"5083","DOI":"10.1080\/00207543.2013.793424","article-title":"Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times","volume":"51","author":"Yin","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C25","article-title":"Single machine CON\/SLK due date assignment scheduling with controllable processing time and job-dependent learning effects","author":"Wang","year":"2017","journal-title":"Comput. J."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1057\/jors.2012.161","article-title":"Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time","volume":"65","author":"Yin","year":"2014","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C27","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1080\/00207543.2015.1056323","article-title":"Due-window assignment scheduling with resource processing times to minimise total resource consumption cost","volume":"54","author":"Liu","year":"2016","journal-title":"Int. J. Prod. Res."},{"year":"2000","author":"Bachman","key":"key\n\t\t\t\t2019011011280038900_bxy030C28"},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C29","first-page":"85","article-title":"Optimal resource allocation for single-machine scheduling problems with time and resource dependent processing times","volume":"28","author":"Janiak","year":"2002","journal-title":"Syst. Sci."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C30","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1016\/j.apm.2011.07.005","article-title":"Single-machine scheduling with time-and-resource-dependent processing times","volume":"62","author":"Wei","year":"2012","journal-title":"Appl. Math. Modelling"},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C31","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1016\/j.apm.2012.05.025","article-title":"Single-machine scheduling with convex resource dependent processing times and deteriorating jobs","volume":"37","author":"Wang","year":"2013","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C32","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00170-013-4771-x","article-title":"Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times","volume":"67","author":"Wang","year":"2013","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C33","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.jmsy.2015.12.002","article-title":"Note on a unified approach to the single-machine scheduling problem with a deterioration effect and convex resource allocation","volume":"38","author":"Zhao","year":"2016","journal-title":"J. Manuf. Syst."},{"issue":"2","key":"key\n\t\t\t\t2019011011280038900_bxy030C34","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.3934\/jimo.2016060","article-title":"Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects","volume":"13","author":"Wang","year":"2017","journal-title":"J. Ind. Manage. Optim."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C35","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C36","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","article-title":"Common due-date assignment to minimize total penalty for the one machine scheduling problem","volume":"30","author":"Panwalker","year":"1982","journal-title":"Oper. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C37","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1057\/jors.1996.155","article-title":"Single machine scheduling with flow allowances","volume":"47","author":"Adamopoulos","year":"1996","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C38","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/00207548108956667","article-title":"Optimal assignment of due dates for a single processor scheduling problem","volume":"19","author":"Seidmann","year":"1981","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C39","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","article-title":"Common due window size and location determination in a single machine scheduling problem","volume":"49","author":"Liman","year":"1998","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C40","first-page":"185","article-title":"Job dependent due-window assignment based on a common flow allowance","volume":"35","author":"Mosheiov","year":"2010","journal-title":"Found. Comput. Decis. Sci."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C41","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ijpe.2011.07.013","article-title":"Scheduling a maintenance activity and due-window assignment based on common flow allowance","volume":"135","author":"Mor","year":"2012","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C42","doi-asserted-by":"crossref","first-page":"8394","DOI":"10.1016\/j.apm.2013.03.041","article-title":"Single machine SLK\/DIF due window assignment problem with learning effect and deteriorating jobs","volume":"37","author":"Wang","year":"2013","journal-title":"Appl. Math. Model."},{"volume-title":"Inequalities","year":"1967","author":"Hardy","key":"key\n\t\t\t\t2019011011280038900_bxy030C43"},{"key":"key\n\t\t\t\t2019011011280038900_bxy030C44","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1016\/j.dam.2011.04.001","article-title":"Complexity analysis of an assignment problem with controllable assignment costs","volume":"159","author":"Yedidsion","year":"2011","journal-title":"Discrete Appl. Math."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/62\/1\/81\/27493046\/bxy030.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T02:26:10Z","timestamp":1660530370000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/62\/1\/81\/4953377"}},"subtitle":[],"editor":[{"given":"Antonio Fernandez","family":"Anta","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,3,24]]},"references-count":44,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,3,24]]},"published-print":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy030","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2019,1]]},"published":{"date-parts":[[2018,3,24]]}}}