{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T14:50:48Z","timestamp":1769352648242,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T00:00:00Z","timestamp":1722902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s12190-024-02198-x","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:03:07Z","timestamp":1722945787000},"page":"6063-6083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Single machine scheduling with generalized due-dates, learning effect, and job-rejection"],"prefix":"10.1007","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Doron","family":"Mor","sequence":"additional","affiliation":[]},{"given":"Noamya","family":"Shani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"issue":"2","key":"2198_CR1","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N.G.: Scheduling problems with generalized due dates. IIE Trans. 18(2), 220\u2013222 (1986). https:\/\/doi.org\/10.1080\/07408178608975351","journal-title":"IIE Trans."},{"issue":"1","key":"2198_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"VS Gordon","year":"2002","unstructured":"Gordon, V.S., Proth, J., Chu, C.: A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139(1), 1\u201325 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(01)00181-3","journal-title":"Eur. J. Oper. Res."},{"key":"2198_CR3","volume-title":"International Business: Competing in the Global Marketplace","author":"CWL Hill","year":"2016","unstructured":"Hill, C.W.L.: International Business: Competing in the Global Marketplace, 6th edn. Mcgraw-Hill College, New York (2016)","edition":"6"},{"issue":"1","key":"2198_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16(1), 3\u201328 (2013). https:\/\/doi.org\/10.1007\/s10951-012-0303-z","journal-title":"J. Sched."},{"key":"2198_CR5","doi-asserted-by":"publisher","unstructured":"Sengupta, S.: Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. In: Dehne, F.K.H.A., Sack, J., Smid, M.H.M. (eds.) Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30\u2013August 1, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2748, pp. 79\u201390. Springer (2003). https:\/\/doi.org\/10.1007\/978-3-540-45078-8_8","DOI":"10.1007\/978-3-540-45078-8_8"},{"issue":"1","key":"2198_CR6","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"JK Lenstra","year":"1978","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"issue":"1","key":"2198_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","volume":"51","author":"NG Hall","year":"1991","unstructured":"Hall, N.G., Sethi, S.P., Sriskandarajah, C.: On the complexity of generalized due date scheduling problems. Eur. J. Oper. Res. 51(1), 100\u2013109 (1991). https:\/\/doi.org\/10.1016\/0377-2217(91)90149-P","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"2198_CR8","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19(5), 544\u2013546 (1973)","journal-title":"Manag. Sci."},{"key":"2198_CR9","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<::AID-NAV3220370401>3.0.CO;2-W","volume":"37","author":"C Sriskandarajah","year":"1990","unstructured":"Sriskandarajah, C.: A note on the generalized due dates scheduling problems. Naval Res. Logist. 37, 587\u2013597 (1990). https:\/\/doi.org\/10.1002\/1520-6750(199008)37:4<::AID-NAV3220370401>3.0.CO;2-W","journal-title":"Naval Res. Logist."},{"key":"2198_CR10","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of Discrete Mathematics vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"1","key":"2198_CR11","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., Mosheiov, G.: Single machine scheduling problems with generalised due-dates and job-rejection. Int. J. Prod. Res. 55(1), 3164\u20133172 (2017). https:\/\/doi.org\/10.1080\/00207543.2016.1266055","journal-title":"Int. J. Prod. Res."},{"key":"2198_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1023\/A:1018987625819","volume":"86","author":"K Tanaka","year":"1999","unstructured":"Tanaka, K., Vlach, M.: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine. Ann. Oper. Res. 86, 507\u2013526 (1999). https:\/\/doi.org\/10.1023\/A:1018987625819","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"2198_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0166-218X(01)00316-X","volume":"122","author":"X Qi","year":"2002","unstructured":"Qi, X., Yu, G., Bard, J.F.: Single machine scheduling with assignable due dates. Discrete Appl. Math. 122(1\u20133), 211\u2013233 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00316-X","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"2198_CR14","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0305-0548(03)00018-2","volume":"31","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., Oron, D.: A note on the SPT heuristic for solving scheduling problems with generalized due dates. Comput. Oper. Res. 31(5), 645\u2013655 (2004). https:\/\/doi.org\/10.1016\/S0305-0548(03)00018-2","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2198_CR15","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2020.12.061","volume":"293","author":"G Mosheiov","year":"2021","unstructured":"Mosheiov, G., Oron, D., Shabtay, D.: Minimizing total late work on a single machine with generalized due-dates. Eur. J. Oper. Res. 293(3), 837\u2013846 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.12.061","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2198_CR16","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1016\/j.amc.2012.08.008","volume":"219","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Cheng, S., Cheng, T.C.E., Wu, C., Wu, W.: Two-agent single-machine scheduling with assignable due dates. Appl. Math. Comput. 219(4), 1674\u20131685 (2012). https:\/\/doi.org\/10.1016\/j.amc.2012.08.008","journal-title":"Appl. Math. Comput."},{"key":"2198_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ijpe.2015.06.018","volume":"168","author":"D-J Wang","year":"2015","unstructured":"Wang, D.-J., Yin, Y., Xu, J., Wu, W.-H., Cheng, S.-R., Wu, C.-C.: Some due date determination scheduling problems with two agents on a single machine. Int. J. Prod. Econ. 168, 81\u201390 (2015). https:\/\/doi.org\/10.1016\/j.ijpe.2015.06.018","journal-title":"Int. J. Prod. Econ."},{"issue":"4","key":"2198_CR18","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis, A., Mosheiov, G.: Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim. Lett. 11(4), 885\u2013892 (2017). https:\/\/doi.org\/10.1007\/s11590-016-1059-8","journal-title":"Optim. Lett."},{"key":"2198_CR19","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.10.021","volume":"204","author":"C He","year":"2016","unstructured":"He, C., Leung, J.Y., Lee, K., Pinedo, M.L.: Scheduling a single machine with parallel batching to minimize makespan and total rejection cost. Discrete Appl. Math. 204, 150\u2013163 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.10.021","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"2198_CR20","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1057\/s41274-016-0003-8","volume":"67","author":"B Mor","year":"2016","unstructured":"Mor, B., Mosheiov, G.: Minimizing maximum cost on a single machine with two competing agents and job rejection. J. Oper. Res. Soc. 67(12), 1524\u20131531 (2016). https:\/\/doi.org\/10.1057\/s41274-016-0003-8","journal-title":"J. Oper. Res. Soc."},{"issue":"12","key":"2198_CR21","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1080\/00207543.2015.1136081","volume":"54","author":"D-J Wang","year":"2016","unstructured":"Wang, D.-J., Yin, Y., Liu, M.: Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. Int. J. Prod. Res. 54(12), 3691\u20133705 (2016). https:\/\/doi.org\/10.1080\/00207543.2015.1136081","journal-title":"Int. J. Prod. Res."},{"key":"2198_CR22","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2017.02.010","volume":"83","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., Mor, B., Mosheiov, G.: Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection. Comput. Oper. Res. 83, 150\u2013156 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.02.010","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2198_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2015","unstructured":"Thevenin, S., Zufferey, N., Widmer, M.: Metaheuristics for a scheduling problem with rejection and tardiness penalties. J. Sched. 18(1), 89\u2013105 (2015). https:\/\/doi.org\/10.1007\/s10951-014-0395-8","journal-title":"J. Sched."},{"issue":"3","key":"2198_CR24","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241(3), 653\u2013661 (2015). https:\/\/doi.org\/10.1016\/j.ejor.2014.09.028","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"2198_CR25","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou, J., Zhong, X., Li, C.: Faster algorithms for single machine scheduling with release dates and rejection. Inf. Process. Lett. 116(8), 503\u2013507 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2016.02.008","journal-title":"Inf. Process. Lett."},{"key":"2198_CR26","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single machine scheduling with release dates and rejection. Eur. J. Oper. Res. 198, 975\u2013978 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.10.006","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2198_CR27","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong, X., Pan, Z., Jiang, D.: Scheduling with release times and rejection on two parallel machines. J. Comb. Optim. 33(3), 934\u2013944 (2017). https:\/\/doi.org\/10.1007\/s10878-016-0016-x","journal-title":"J. Comb. Optim."},{"key":"2198_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2017.12.004","volume":"132","author":"S Fiszman","year":"2018","unstructured":"Fiszman, S., Mosheiov, G.: Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection. Inf. Process. Lett. 132, 39\u201343 (2018). https:\/\/doi.org\/10.1016\/j.ipl.2017.12.004","journal-title":"Inf. Process. Lett."},{"issue":"11","key":"2198_CR29","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor, B., Shapira, D.: Improved algorithms for scheduling on proportionate flowshop with job-rejection. J. Oper. Res. Soc. 70(11), 1997\u20132003 (2019). https:\/\/doi.org\/10.1080\/01605682.2018.1506540","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"2198_CR30","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1080\/01605682.2019.1621222","volume":"71","author":"B Mor","year":"2020","unstructured":"Mor, B., Shapira, D.: Scheduling with regular performance measures and optional job rejection on a single machine. J. Oper. Res. Soc. 71(8), 1315\u20131325 (2020). https:\/\/doi.org\/10.1080\/01605682.2019.1621222","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"2198_CR31","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10951-021-00697-4","volume":"24","author":"B Mor","year":"2021","unstructured":"Mor, B., Mosheiov, G., Shabtay, D.: Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. J. Sched. 24(6), 553\u2013567 (2021). https:\/\/doi.org\/10.1007\/s10951-021-00697-4","journal-title":"J. Sched."},{"key":"2198_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106133","volume":"152","author":"M Atsmony","year":"2023","unstructured":"Atsmony, M., Mor, B., Mosheiov, G.: Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Comput. Oper. Res. 152, 106133 (2023). https:\/\/doi.org\/10.1016\/j.cor.2022.106133","journal-title":"Comput. Oper. Res."},{"key":"2198_CR33","doi-asserted-by":"publisher","unstructured":"Gawiejnowicz, S.: Time-Dependent Scheduling. Monographs in Theoretical Computer Science. An EATCS Series. Springer, ??? (2008). https:\/\/doi.org\/10.1007\/978-3-540-69446-5","DOI":"10.1007\/978-3-540-69446-5"},{"issue":"6","key":"2198_CR34","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","volume":"57","author":"S Gawiejnowicz","year":"1996","unstructured":"Gawiejnowicz, S.: A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf. Process. Lett. 57(6), 297\u2013300 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00021-X","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2198_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup, D.: Single-machine scheduling with learning considerations. Eur. J. Oper. Res. 115(1), 173\u2013178 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00246-X","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2198_CR36","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., Said, L.B.: Scheduling problems under learning effects: classification and cartography. Int. J. Prod. Res. 56(4), 1642\u20131661 (2018). https:\/\/doi.org\/10.1080\/00207543.2017.1355576","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"2198_CR37","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ejor.2023.01.028","volume":"309","author":"K Chen","year":"2023","unstructured":"Chen, K., Cheng, T.C.E., Huang, H., Ji, M., Yao, D.: Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs. Eur. J. Oper. Res. 309(1), 24\u201334 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.01.028","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2198_CR38","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G.: Scheduling problems with a learning effect. Eur. J. Oper. Res. 132(3), 687\u2013693 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00175-2","journal-title":"Eur. J. Oper. Res."},{"issue":"16\u201318","key":"2198_CR39","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Lu, L., Yuan, J.: Single-machine scheduling under the job rejection constraint. Theor. Comput. Sci. 411(16\u201318), 1877\u20131882 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2198_CR40","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10951-019-00612-y","volume":"23","author":"B Mor","year":"2020","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Flowship scheduling with learning effect and job rejection. J. Sched. 23(6), 631\u2013641 (2020). https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J. Sched."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02198-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-024-02198-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-024-02198-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T14:04:28Z","timestamp":1732889068000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-024-02198-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,6]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2198"],"URL":"https:\/\/doi.org\/10.1007\/s12190-024-02198-x","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,6]]},"assertion":[{"value":"11 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}