{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:16:27Z","timestamp":1758824187000,"version":"3.37.3"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"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","61403260","71672019"],"award-info":[{"award-number":["71471120","61403260","71672019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovative Talents in Liaoning University"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1093\/comjnl\/bxy007","type":"journal-article","created":{"date-parts":[[2018,1,13]],"date-time":"2018-01-13T07:07:40Z","timestamp":1515827260000},"page":"1422-1428","source":"Crossref","is-referenced-by-count":10,"title":["Makespan minimization scheduling with ready times, group technology and shortening job processing times"],"prefix":"10.1093","volume":"61","author":[{"given":"Ji-Bo","family":"Wang","sequence":"first","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang, China"}]},{"given":"Lu","family":"Liu","sequence":"additional","affiliation":[{"name":"Faculty of Management and Economics, Dalian University of Technology, Dalian, China"}]},{"given":"Jian-Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"Faculty of Management and Economics, Dalian University of Technology, Dalian, China"}]},{"given":"Lin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Science, Shenyang Aerospace University, Shenyang, China"}]}],"member":"286","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"key\n\t\t\t\t20180827114422_bxy007C1","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\t20180827114422_bxy007C2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","article-title":"Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity","volume":"43","author":"Potts","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"key\n\t\t\t\t20180827114422_bxy007C3","doi-asserted-by":"crossref","first-page":"6410","DOI":"10.1016\/j.apm.2015.01.069","article-title":"A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties","volume":"39","author":"Keshavarz","year":"2015","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180827114422_bxy007C4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","article-title":"A comprehensive review of flowshop group scheduling literature","volume":"70","author":"Neufeld","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s00170-011-3639-1","article-title":"Group scheduling with independent setup times, ready times, and deteriorating job processing times","volume":"60","author":"Wang","year":"2012","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"key\n\t\t\t\t20180827114422_bxy007C6","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.apm.2013.05.064","article-title":"Single-machine ready times scheduling with group technology and proportional linear deterioration","volume":"38","author":"Xu","year":"2014","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180827114422_bxy007C7","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. (Ny)."},{"key":"key\n\t\t\t\t20180827114422_bxy007C8","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1080\/00207721.2013.822126","article-title":"One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations","volume":"46","author":"He","year":"2015","journal-title":"Int. J. Syst. Sci."},{"key":"key\n\t\t\t\t20180827114422_bxy007C9","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.apm.2011.07.068","article-title":"Single-machine group scheduling with general deterioration and learning effects","volume":"36","author":"Bai","year":"2012","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180827114422_bxy007C10","doi-asserted-by":"crossref","first-page":"6410","DOI":"10.1016\/j.apm.2015.01.069","article-title":"A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties","volume":"39","author":"Keshavarz","year":"2015","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180827114422_bxy007C11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","article-title":"A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times","volume":"170","author":"Liou","year":"2015","journal-title":"Int. J. Prod. Econ."},{"key":"key\n\t\t\t\t20180827114422_bxy007C12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ejor.2015.07.001","article-title":"Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints","volume":"248","author":"Herr","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90175-9","article-title":"Complexity of scheduling tasks with time-dependent execution times","volume":"48","author":"Ho","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t20180827114422_bxy007C14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ipl.2004.12.018","article-title":"Scheduling jobs under decreasing linear deterioration","volume":"94","author":"Wang","year":"2005","journal-title":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t20180827114422_bxy007C15","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02832317","article-title":"Single machine group scheduling under decreasing linear deterioration","volume":"24","author":"Wang","year":"2007","journal-title":"J. Appl. Math. Comput."},{"key":"key\n\t\t\t\t20180827114422_bxy007C16","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00170-009-2444-6","article-title":"Single-machine group scheduling with decreasing linear deterioration setup times and job processing times","volume":"49","author":"Wang","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"key\n\t\t\t\t20180827114422_bxy007C17","first-page":"286","article-title":"Single machine group scheduling with decreasing time-dependent processing times subject to release dates","volume":"234","author":"Lu","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20180827114422_bxy007C18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-6377(92)90092-H","article-title":"Efficient Heuristics to minimize total flow time with release dates","volume":"12","author":"Chu","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"key\n\t\t\t\t20180827114422_bxy007C19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1137\/0210014","article-title":"Sequencing jobs with unequal ready times to minimize mean flow time","volume":"10","author":"Dessouky","year":"1981","journal-title":"SIAM J. Comput."},{"key":"key\n\t\t\t\t20180827114422_bxy007C20","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.10.4.576","article-title":"Analysis of heuristics for two-machine flow-shop sequencing subject to release dates","volume":"10","author":"Potts","year":"1985","journal-title":"Math. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C21","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2010.11.021","article-title":"Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan","volume":"210","author":"Li","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C22","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.cor.2011.05.024","article-title":"Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates","volume":"39","author":"Nessah","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C23","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.ejor.2013.05.041","article-title":"New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria","volume":"231","author":"Prot","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C24","first-page":"10401","article-title":"The single-machine total tardiness problem with unequal release times and a linear deterioration","volume":"219","author":"Wu","year":"2013","journal-title":"Appl. Math. Model."},{"key":"key\n\t\t\t\t20180827114422_bxy007C25","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.cor.2015.04.025","article-title":"Bicriteria scheduling problem for unrelated parallel machines with release dates","volume":"64","author":"Lin","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"key\n\t\t\t\t20180827114422_bxy007C26","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cie.2013.11.017","article-title":"Group scheduling and job-dependent due window assignment based on a common flow allowance","volume":"68","author":"Ji","year":"2014","journal-title":"Comput. Ind. Eng."},{"key":"key\n\t\t\t\t20180827114422_bxy007C27","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."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/9\/1422\/25570031\/bxy007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T05:59:27Z","timestamp":1570600767000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/61\/9\/1422\/4835633"}},"subtitle":[],"editor":[{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":27,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,2,2]]},"published-print":{"date-parts":[[2018,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy007","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2018,9]]},"published":{"date-parts":[[2018,2,2]]}}}