{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T22:17:43Z","timestamp":1772057863753,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T00:00:00Z","timestamp":1704412800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T00:00:00Z","timestamp":1704412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2505\/19"],"award-info":[{"award-number":["2505\/19"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11590-023-02086-6","type":"journal-article","created":{"date-parts":[[2024,1,5]],"date-time":"2024-01-05T10:02:27Z","timestamp":1704448947000},"page":"751-766","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Single machine scheduling to minimize maximum earliness\/tardiness cost with job rejection"],"prefix":"10.1007","volume":"18","author":[{"given":"Matan","family":"Atsmony","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,5]]},"reference":[{"issue":"4","key":"2086_CR1","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)","journal-title":"Optim. Lett."},{"issue":"4","key":"2086_CR2","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"RX Chen","year":"2020","unstructured":"Chen, R.X., Li, S.S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40(4), 1044\u20131064 (2020)","journal-title":"J. Comb. Optim."},{"key":"2086_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.cor.2018.10.006","volume":"102","author":"R Cordone","year":"2019","unstructured":"Cordone, R., Hosteins, P.: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Comput. Oper. Res. 102, 130\u2013140 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2086_CR4","first-page":"158","volume":"32","author":"M Dabiri","year":"2019","unstructured":"Dabiri, M., Darestani, S.A., Naderi, B.: Multi-machine flow shop scheduling problems with rejection using genetic algorithm. Int. J. Serv. Oper. Manag. 32(2), 158\u2013172 (2019)","journal-title":"Int. J. Serv. Oper. Manag."},{"issue":"2","key":"2086_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2020.09.042","volume":"291","author":"M de Weerdt","year":"2021","unstructured":"de Weerdt, M., Baart, R., He, L.: Single-machine scheduling with release times, deadlines, setup times, and rejection. Eur. J. Oper. Res. 291(2), 629\u2013639 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"2086_CR6","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)","journal-title":"Inf. Process. Lett."},{"key":"2086_CR7","doi-asserted-by":"crossref","unstructured":"Geng, X. N., Sun, X., Wang, J., Pan, L.:. Scheduling on proportionate flow shop with job rejection and common due date assignment.\u00a0Comput. Ind. Eng. 109317 (2023)","DOI":"10.1016\/j.cie.2023.109317"},{"issue":"8","key":"2086_CR8","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1080\/0305215X.2018.1521397","volume":"51","author":"XN Geng","year":"2019","unstructured":"Geng, X.N., Wang, J.B., Bai, D.: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect. Eng. Optim. 51(8), 1301\u20131323 (2019)","journal-title":"Eng. Optim."},{"issue":"3","key":"2086_CR9","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1080\/00207543.2019.1709672","volume":"59","author":"E Gerstl","year":"2021","unstructured":"Gerstl, E., Mosheiov, G.: The single machine CON problem with unavailability period. Int. J. Prod. Res. 59(3), 824\u2013838 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"2086_CR10","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\u201325 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2086_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Pinedo, M., Shabtay, D., Talmon, N.: On the parameterized tractability of single machine scheduling with rejection. Eur. J. Oper. Res. 273(1), 67\u201373 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"2086_CR12","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1080\/00207543.2020.1727042","volume":"59","author":"C Koulamas","year":"2021","unstructured":"Koulamas, C., Kyparisis, G.J.: The no-wait flow shop with rejection. Int. J. Prod. Res. 59(6), 1852\u20131859 (2021)","journal-title":"Int. J. Prod. Res."},{"key":"2086_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2015.04.014","volume":"87","author":"C Koulamas","year":"2015","unstructured":"Koulamas, C., Panwalkar, S.S.: On the equivalence of single machine earliness\/tardiness problems with job rejection. Comput. Ind. Eng. 87, 1\u20133 (2015)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"2086_CR14","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s11590-019-01389-x","volume":"14","author":"M Kong","year":"2020","unstructured":"Kong, M., Liu, X., Pei, J., Zhou, Z., Pardalos, P.M.: Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine. Optim. Lett. 14(4), 857\u2013871 (2020)","journal-title":"Optim. Lett."},{"issue":"02","key":"2086_CR15","doi-asserted-by":"publisher","first-page":"1750010","DOI":"10.1142\/S0217595917500105","volume":"34","author":"SS Li","year":"2017","unstructured":"Li, S.S., Chen, R.X.: Scheduling with rejection and a deteriorating maintenance activity on a single machine. Asia-Pac. J. Oper. Res. 34(02), 1750010 (2017)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"7","key":"2086_CR16","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1007\/s11590-019-01462-5","volume":"14","author":"SS Li","year":"2020","unstructured":"Li, S.S., Chen, R.X.: Scheduling with common due date assignment to minimize generalized weighted earliness\u2013tardiness penalties. Optim. Lett. 14(7), 1681\u20131699 (2020)","journal-title":"Optim. Lett."},{"issue":"3","key":"2086_CR17","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s10878-019-00429-7","volume":"38","author":"SS Li","year":"2019","unstructured":"Li, S.S., Chen, R.X., Feng, Q., Jiao, C.W.: Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J. Comb. Optim. 38(3), 957\u2013971 (2019)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"2086_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10288-017-0356-0","volume":"16","author":"W Li","year":"2018","unstructured":"Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR 16(1), 95\u2013104 (2018)","journal-title":"4OR"},{"issue":"1","key":"2086_CR19","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/0305215X.2019.1580705","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu, W., Jiang, C.: Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Eng. Optim. 52(1), 74\u201389 (2020)","journal-title":"Eng. Optim."},{"issue":"4","key":"2086_CR20","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"P Liu","year":"2020","unstructured":"Liu, P., Lu, X.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4), 929\u2013952 (2020)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"2086_CR21","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/0305215X.2019.1608980","volume":"52","author":"W Liu","year":"2020","unstructured":"Liu, W., Yao, Y., Jiang, C.: Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng. Optim. 52(4), 701\u2013714 (2020)","journal-title":"Eng. Optim."},{"issue":"6","key":"2086_CR22","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"DY Lv","year":"2021","unstructured":"Lv, D.Y., Wang, J.B.: Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim. Lett. 15(6), 2311\u20132319 (2021)","journal-title":"Optim. Lett."},{"issue":"2","key":"2086_CR23","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10479-018-2779-1","volume":"271","author":"B Mor","year":"2018","unstructured":"Mor, B., Mosheiov, G.: A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Ann. Oper. Res. 271(2), 1079\u20131085 (2018)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"2086_CR24","doi-asserted-by":"publisher","first-page":"2707","DOI":"10.1007\/s12351-021-00627-4","volume":"22","author":"B Mor","year":"2022","unstructured":"Mor, B., Mosheiov, G.: Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Oper. Res. Int. J. 22(3), 2707\u20132719 (2022)","journal-title":"Oper. Res. Int. J."},{"key":"2086_CR25","doi-asserted-by":"crossref","unstructured":"Mor, B., Mosheiov, G., & Shapira, D.: Flowshop scheduling with learning effect and job rejection.\u00a0J. Schedul. 1\u201311 (2019)","DOI":"10.1007\/s10288-020-00436-z"},{"issue":"1","key":"2086_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor, B., Mosheiov, G., Shapira, D.: Single machine lot scheduling with optional job-rejection. J. Comb. Optim. 41(1), 1\u201311 (2021)","journal-title":"J. Comb. Optim."},{"issue":"11","key":"2086_CR27","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)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"2086_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor, B., Shapira, D.: Regular scheduling measures on proportionate flowshop with job rejection. Comput. Appl. Math. 39(2), 1\u201314 (2020)","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"2086_CR29","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s11590-021-01763-8","volume":"16","author":"B Mor","year":"2022","unstructured":"Mor, B., Shapira, D.: Minsum scheduling with acceptable lead-times and optional job rejection. Optim. Lett. 16(3), 1073\u20131091 (2022)","journal-title":"Optim. Lett."},{"key":"2086_CR30","doi-asserted-by":"crossref","unstructured":"Mosheiov, G., Pruwer, S.: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops.\u00a0Eng. Optim. 1\u201317 (2020)","DOI":"10.1080\/0305215X.2020.1735380"},{"issue":"4","key":"2086_CR31","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10288-019-00418-w","volume":"18","author":"G Mosheiov","year":"2020","unstructured":"Mosheiov, G., Sarig, A., Strusevich, V.: Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18(4), 439\u2013456 (2020)","journal-title":"4OR"},{"key":"2086_CR32","doi-asserted-by":"crossref","unstructured":"Nasrollahi, V., Moslehi, G., Reisi-Nafchi, M.:. Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem.\u00a0Oper. Res. 1\u201340 (2020)","DOI":"10.1007\/s12351-020-00577-3"},{"key":"2086_CR33","doi-asserted-by":"crossref","unstructured":"Oron, D.: Two-agent scheduling problems under rejection budget constraints.\u00a0Omega, 102313 (2020)","DOI":"10.1016\/j.omega.2020.102313"},{"key":"2086_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"SS Panwalkar","year":"1982","unstructured":"Panwalkar, S.S., Smith, M.L., Seidmann, A.: Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30, 391\u2013399 (1982)","journal-title":"Oper. Res."},{"key":"2086_CR35","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, 3\u201328 (2013)","journal-title":"J. Sched."},{"key":"2086_CR36","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.dam.2018.03.019","volume":"261","author":"S Thevenin","year":"2019","unstructured":"Thevenin, S., Zufferey, N.: Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discrete Appl. Math. 261, 344\u2013353 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2086_CR37","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10732-016-9321-x","volume":"22","author":"S Thevenin","year":"2016","unstructured":"Thevenin, S., Zufferey, N., Widmer, M.: Order acceptance and scheduling with earliness and tardiness penalties. J. Heurist. 22, 849\u2013890 (2016)","journal-title":"J. Heurist."},{"issue":"3","key":"2086_CR38","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/0305215X.2021.1876041","volume":"54","author":"JB Wang","year":"2022","unstructured":"Wang, J.B., Xu, J.X., Guo, F., Liu, M.: Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times. Eng. Optim. 54(3), 471\u2013486 (2022)","journal-title":"Eng. Optim."},{"key":"2086_CR39","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2018","unstructured":"Wang, D., Yin, Y., Cheng, T.C.E.: Parallel-machine rescheduling with job unavailability and rejection. Omega 81, 246\u2013260 (2018)","journal-title":"Omega"},{"key":"2086_CR40","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, 1877\u20131882 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2086_CR41","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Xu, D., Du, D., Wu, C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35(1), 318\u2013330 (2018)","journal-title":"J. Comb. Optim."},{"key":"2086_CR42","doi-asserted-by":"publisher","first-page":"100609","DOI":"10.1016\/j.disopt.2020.100609","volume":"38","author":"J Zou","year":"2020","unstructured":"Zou, J., Yuan, J.: Single-machine scheduling with maintenance activities and rejection. Discret. Optim. 38, 100609 (2020)","journal-title":"Discret. Optim."},{"issue":"8","key":"2086_CR43","doi-asserted-by":"publisher","first-page":"668","DOI":"10.3390\/math7080668","volume":"7","author":"L Zuo","year":"2019","unstructured":"Zuo, L., Sun, Z., Lu, L., Zhang, L.: Single-machine scheduling with rejection and an operator non-availability interval. Mathematics 7(8), 668 (2019)","journal-title":"Mathematics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02086-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02086-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02086-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T11:41:48Z","timestamp":1711107708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02086-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,5]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2086"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02086-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,5]]},"assertion":[{"value":"3 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}