{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:14Z","timestamp":1777755494550,"version":"3.51.4"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"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":[[2023,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we examined single and parallel machine scheduling problems with a learning effect and job rejection simultaneously. In real life, job processing times decrease when there is a learning effect. In some cases, producers cannot process all the jobs and pay the penalty cost for these jobs that they do not process. In our study, learning effect and job rejection are considered at the same time. We examined four different objective functions. Our objectives for single-machine scheduling problems are makespan and rejection cost minimization, total completion time and rejection cost minimization and total absolute deviation of completion times (TADC) and rejection cost minimization. Our objective for parallel machines is makespan and rejection cost minimization. The problems are solved by mathematical models, and four different algorithms are proposed for the problems. From these algorithms, the same results are obtained with single-machine makespan and rejection cost minimization, parallel machine makespan and rejection cost minimization and total completion time and rejection cost minimization. The accuracy for these models is obtained as 100%. The proposed algorithm for TADC and rejection cost minimization yielded close-to-optimal results. Mathematical model and algorithm results for 10 jobs, 20 jobs and 30 jobs are compared and the results are presented. The obtained solutions are obtained in polynomial time.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab201","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T04:19:27Z","timestamp":1638245967000},"page":"866-872","source":"Crossref","is-referenced-by-count":6,"title":["Some Scheduling Problems With Job Rejection And A Learning Effect"],"prefix":"10.1093","volume":"66","author":[{"given":"M Duran","family":"Toksari","sequence":"first","affiliation":[{"name":"Industrial Engineering Department , Engineering Faculty, , Kayseri 38039, Turkey"},{"name":"Erciyes University , Engineering Faculty, , Kayseri 38039, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berrin","family":"Atalay","sequence":"additional","affiliation":[{"name":"Industrial Engineering Department , Engineering Faculty, , Kayseri 38039, Turkey"},{"name":"Erciyes University , Engineering Faculty, , Kayseri 38039, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,1,4]]},"reference":[{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","article-title":"Scheduling problems with a learning effect","volume":"132","author":"Mosheiov","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1057\/palgrave.jors.2601215","article-title":"Parallel machine scheduling with a learning effect","volume":"52","author":"Mosheiov","year":"2001","journal-title":"J. Oper. Res. Soc."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","article-title":"Single-machine scheduling with learning considerations","volume":"115","author":"Biskup","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.ejor.2006.01.030","article-title":"Single-machine and two-machine flowshop scheduling with general learning functions","volume":"178","author":"Koulamas","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"2099","DOI":"10.1016\/j.cor.2004.11.024","article-title":"Single-machine group scheduling with a time-dependent learning effect","volume":"33","author":"Kuo","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1016\/j.ejor.2005.03.020","article-title":"Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect","volume":"174","author":"Kuo","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"2023041809375787800_","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":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.apm.2007.03.001","article-title":"Single-machine scheduling problems with a learning effect","volume":"32","author":"Wu","year":"2008","journal-title":"Appl. Math. Model."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"2159","DOI":"10.1016\/j.apm.2008.05.020","article-title":"A note on single-machine group scheduling problems with position-based learning effect","volume":"33","author":"Lee","year":"2009","journal-title":"Appl. Math. Model."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/j.apm.2006.03.030","article-title":"Minimizing total tardiness in a scheduling problem with a learning effect","volume":"31","author":"Eren","year":"2007","journal-title":"Appl. Math. Model."},{"key":"2023041809375787800_","volume-title":"Operations Management","author":"Heizer","year":"2001","edition":"7th"},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1080\/0305215X.2019.1664498","article-title":"Scheduling with a position-weighted learning effect and job release dates","volume":"52","author":"Wang","year":"2020","journal-title":"Eng. Optim."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"113445","DOI":"10.1016\/j.eswa.2020.113445","article-title":"Effective algorithms for single-machine learning-effect scheduling to minimize completion-time-based criteria with release dates","volume":"156","author":"Bai","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","article-title":"Two-machine flowshop scheduling with a truncated learning function to minimize the makespan","volume":"141","author":"Cheng","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"2023041809375787800_","first-page":"355","article-title":"Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect","volume":"208","author":"Eren","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM J. Discret. Math."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","article-title":"Single-machine scheduling under the job rejection constraint","volume":"411","author":"Zhang","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"3642","DOI":"10.1016\/j.tcs.2010.06.008","article-title":"Parallel-machine scheduling with deteriorating jobs and rejection","volume":"411","author":"Li","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ipl.2012.06.009","article-title":"Scheduling on parallel identical machines with job-rejection and position-dependent processing times","volume":"112","author":"Gerstl","year":"2012","journal-title":"Inf. Process. Lett."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.mcm.2009.05.026","article-title":"Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning","volume":"50","author":"Toksar\u0131","year":"2009","journal-title":"Math. Comput. Model."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","article-title":"Minimizing variation of flow time in single machine systems","volume":"27","author":"Kanet","year":"1981","journal-title":"Manag. Sci."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1016\/j.cor.2006.10.010","article-title":"Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times","volume":"35","author":"Oron","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.ijpe.2008.11.011","article-title":"Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times","volume":"118","author":"Li","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"2023041809375787800_","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0377-2217(02)00358-2","article-title":"Scheduling with general job-dependent learning curves","volume":"147","author":"Mosheiov","year":"2003","journal-title":"Eur. J. Oper. Res."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/866\/49931900\/bxab201.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/4\/866\/49931900\/bxab201.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T10:21:36Z","timestamp":1699870896000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/4\/866\/6494710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,4]]},"references-count":24,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,1,4]]},"published-print":{"date-parts":[[2023,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab201","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,4]]},"published":{"date-parts":[[2022,1,4]]}}}