{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:52:41Z","timestamp":1769309561976,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T00:00:00Z","timestamp":1625788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T00:00:00Z","timestamp":1625788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11590-021-01763-8","type":"journal-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T10:03:03Z","timestamp":1625824983000},"page":"1073-1091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minsum scheduling with acceptable lead-times and optional job rejection"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","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":[[2021,7,9]]},"reference":[{"key":"1763_CR1","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11750321_8","volume":"3959","author":"ZG Cao","year":"2006","unstructured":"Cao, Z.G., Wang, Z., Zhang, Y.Z., Liu, S.P.: On several scheduling problems with rejection or discretely compressible processing times. Lect. Notes Comput. Sci. 3959, 90\u201398 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1763_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15, 483\u2013495 (1990)","journal-title":"Math. Oper. Res."},{"key":"1763_CR3","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)","journal-title":"Comput. Oper. Res."},{"key":"1763_CR4","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, 3164\u20133172 (2017)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"1763_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10479-013-1458-5","volume":"211","author":"E Gerstl","year":"2013","unstructured":"Gerstl, E., Mosheiov, G.: Minmax due-date assignment with a time window for acceptable lead-times. Ann. Oper. Res. 211(1), 167\u2013177 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"9","key":"1763_CR6","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1057\/jors.2014.132","volume":"66","author":"E Gerstl","year":"2015","unstructured":"Gerstl, E., Mosheiov, G.: Scheduling with a due-window for acceptable lead-times. J. Oper. Res. Soc. 66(9), 1578\u20131588 (2015)","journal-title":"J. Oper. Res. Soc."},{"key":"1763_CR7","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1016\/j.dam.2010.01.013","volume":"158","author":"I Kacem","year":"2010","unstructured":"Kacem, I.: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discret. Appl. Math. 158, 1035\u20131040 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1763_CR8","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2006.08.030","volume":"369","author":"H Kellerer","year":"2006","unstructured":"Kellerer, H., Strusevich, V.A.: A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoret. Comput. Sci. 369, 230\u2013238 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"1763_CR9","doi-asserted-by":"publisher","first-page":"2205","DOI":"10.1016\/j.dam.2013.02.026","volume":"161","author":"K Kianfar","year":"2013","unstructured":"Kianfar, K., Moslehi, G.: A note on \u201cFully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date.\u201d Discrete Appl. Math. 161, 2205\u20132206 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1763_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler, E.L.: A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1, 331\u2013342 (1977)","journal-title":"Ann. Discrete Math."},{"key":"1763_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ejor.2010.02.026","volume":"206","author":"Y Leyvand","year":"2010","unstructured":"Leyvand, Y., Shabtay, D., Steiner, G.: A unified approach for scheduling with convex resource consumption functions using positional penalties. Eur. J. Oper. Res. 206, 301\u2013312 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1763_CR12","doi-asserted-by":"publisher","first-page":"2161","DOI":"10.1016\/j.cor.2013.03.004","volume":"40","author":"B Mor","year":"2013","unstructured":"Mor, B., Mosheiov, G., Shabtay, D.: A note: minmax due-date assignment problem with lead-time cost. Comput. Oper. Res. 40, 2161\u20132164 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"1763_CR13","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)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"1763_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1080\/0305215X.2020.1735380","volume":"53","author":"G Mosheiov","year":"2021","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. Eng. Optim. 53(3), 408\u2013424 (2021)","journal-title":"Eng. Optim."},{"key":"1763_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/00207548108956667","volume":"19","author":"A Seidmann","year":"1981","unstructured":"Seidmann, A., Panwalkar, S.S., Smith, M.L.: Optimal assignment of due-dates for a single processor scheduling problem. Int. J. Prod. Res. 19, 393\u2013399 (1981)","journal-title":"Int. J. Prod. Res."},{"key":"1763_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ijpe.2009.08.012","volume":"123","author":"D Shabtay","year":"2010","unstructured":"Shabtay, D.: Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs. Int. J. Prod. Econ. 123, 235\u2013242 (2010)","journal-title":"Int. J. Prod. Econ."},{"key":"1763_CR17","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":"1763_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.orl.2005.10.009","volume":"34","author":"D Shabtay","year":"2006","unstructured":"Shabtay, D., Steiner, G.: Two due-date assignment problems in scheduling a single machine. Oper. Res. Lett. 34, 683\u2013691 (2006)","journal-title":"Oper. Res. Lett."},{"key":"1763_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10479-007-0269-y","volume":"159","author":"D Shabtay","year":"2008","unstructured":"Shabtay, D., Steiner, G.: The single-machine earliness-tardiness scheduling problem with due-date assignment and resource-dependent processing times. Ann. Oper. Res. 159, 25\u201340 (2008)","journal-title":"Ann. Oper. Res."},{"key":"1763_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10951-007-0015-y","volume":"11","author":"D Shabtay","year":"2008","unstructured":"Shabtay, D., Steiner, G.: Optimal due date assignment in multi-machine scheduling environments. J. Sched. 11, 217\u2013228 (2008)","journal-title":"J. Sched."},{"key":"1763_CR21","doi-asserted-by":"publisher","first-page":"1504","DOI":"10.1287\/opre.1110.0948","volume":"59","author":"G Steiner","year":"2011","unstructured":"Steiner, G., Zhang, R.: Revised delivery-time quotation in scheduling with tardiness penalties. Oper. Res. 59, 1504\u20131511 (2011)","journal-title":"Oper. Res."},{"key":"1763_CR22","first-page":"328","volume":"5","author":"J Yuan","year":"1992","unstructured":"Yuan, J.: The NP-hardness of the single machine common due date weighted tardiness problem. Tabriz Univ. Ser. 5, 328\u2013333 (1992)","journal-title":"Tabriz Univ. Ser."},{"key":"1763_CR23","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. Theoret. Comput. Sci. 411, 1877\u20131882 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"1763_CR24","doi-asserted-by":"crossref","first-page":"691","DOI":"10.3934\/jimo.2014.10.691","volume":"10","author":"C Zhao","year":"2014","unstructured":"Zhao, C., Yin, Y., Cheng, T.C.E., Wu, C.C.: Single-machine scheduling and due date assignment with rejection and position-dependent processing times. J. Indus. Manag. Optim. 10(3), 691\u2013700 (2014)","journal-title":"J. Indus. Manag. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01763-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01763-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01763-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T13:27:53Z","timestamp":1672752473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01763-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1763"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01763-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,9]]},"assertion":[{"value":"10 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2021","order":3,"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 interests"}}]}}