{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T01:07:51Z","timestamp":1662426471384},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2018,4,3]],"date-time":"2018-04-03T00:00:00Z","timestamp":1522713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1093\/comjnl\/bxy034","type":"journal-article","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T12:07:10Z","timestamp":1521634030000},"page":"90-96","source":"Crossref","is-referenced-by-count":5,"title":["No-wait resource allocation flowshop scheduling with learning effect under limited cost availability"],"prefix":"10.1093","volume":"62","author":[{"given":"Yu","family":"Tian","sequence":"first","affiliation":[{"name":"School of Management and Journalism and Communications, Shenyang Sport University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Civil Engineering, Tsinghia University, Beijing, 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":"Xiao-Yuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang, China"},{"name":"School of Management, Xi\u2019an Jiaotong University, Xi\u2019an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,4,3]]},"reference":[{"key":"key\n\t\t\t\t2019011011280000200_bxy034C1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","article-title":"A state-of-the-art review on scheduling with learning effects","volume":"188","author":"Biskup","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C2","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\t2019011011280000200_bxy034C3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10479-012-1111-8","article-title":"Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect","volume":"196","author":"Kuo","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C4","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1007\/s11590-012-0494-4","article-title":"Single machine scheduling with sum-of-logarithm-processing-times based and position based learning effects","volume":"8","author":"Wang","year":"2014","journal-title":"Optim. Lett."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C5","doi-asserted-by":"crossref","first-page":"2906","DOI":"10.1016\/j.cor.2013.07.001","article-title":"Several flow shop scheduling problems with truncated position-based learning effect","volume":"40","author":"Wang","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C6","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/j.cie.2015.05.032","article-title":"Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time","volume":"87","author":"Shiau","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C7","article-title":"Research on m-machine flow shop scheduling with truncated learning effects","author":"Wang","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C8","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\t2019011011280000200_bxy034C9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cor.2013.08.007","article-title":"Batch scheduling of identical jobs with controllable processing times","volume":"41","author":"Mor","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ijpe.2013.12.021","article-title":"Scheduling problems with multiple due windows assignment and controllable processing times on a single machine","volume":"150","author":"Yang","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C11","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1080\/00207543.2015.1056323","article-title":"Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost","volume":"54","author":"Liu","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C12","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.asoc.2015.01.028","article-title":"Decision support for unrelated parallel machine scheduling with discrete controllable processing times","volume":"30","author":"Hsieh","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C13","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."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C14","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\t2019011011280000200_bxy034C15","doi-asserted-by":"crossref","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":"key\n\t\t\t\t2019011011280000200_bxy034C16","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.cie.2010.10.012","article-title":"Single-machine group scheduling with resource allocation and learning effect","volume":"60","author":"Zhu","year":"2011","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C17","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\t2019011011280000200_bxy034C18","doi-asserted-by":"crossref","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":"key\n\t\t\t\t2019011011280000200_bxy034C19","doi-asserted-by":"crossref","first-page":"5826","DOI":"10.1080\/00207543.2015.1010746","article-title":"Research on scheduling with job-dependent learning effect and convex resource dependent processing times","volume":"53","author":"Wang","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C20","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\t2019011011280000200_bxy034C21","doi-asserted-by":"crossref","first-page":"1450036","DOI":"10.1142\/S0217595914500365","article-title":"Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times","volume":"31","author":"Wang","year":"2014","journal-title":"Asia Pac. J. Oper. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C22","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1080\/00207543.2014.954057","article-title":"Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation","volume":"53","author":"Li","year":"2015","journal-title":"Int. J. Prod. Res."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C23","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cie.2014.06.017","article-title":"Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times","volume":"75","author":"Liu","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C24","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.omega.2004.10.006","article-title":"Flowshop scheduling with deteriorating jobs under dominating machines","volume":"34","author":"Wang","year":"2006","journal-title":"Omega"},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0895-7177(94)90206-2","article-title":"Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption","volume":"20","author":"Janiak","year":"1994","journal-title":"Math. Comput. Model."},{"key":"key\n\t\t\t\t2019011011280000200_bxy034C26","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\t2019011011280000200_bxy034C27","volume-title":"Inequalities","author":"Hardy","year":"1967"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/62\/1\/90\/27493044\/bxy034.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T16:44:48Z","timestamp":1660668288000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/62\/1\/90\/4959080"}},"subtitle":[],"editor":[{"given":"Antonio Fernandez","family":"Anta","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,4,3]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,4,3]]},"published-print":{"date-parts":[[2019,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy034","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,1]]},"published":{"date-parts":[[2018,4,3]]}}}