{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:55:25Z","timestamp":1774950925838,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T00:00:00Z","timestamp":1728000000000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10479-024-06290-0","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T20:34:25Z","timestamp":1728074065000},"page":"401-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The minmax due-date assignment problem with acceptable lead-times"],"prefix":"10.1007","volume":"343","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0807-3127","authenticated-orcid":false,"given":"Assaf","family":"Sarig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,4]]},"reference":[{"key":"6290_CR789","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2020.05.023","volume":"290","author":"X Chen","year":"2021","unstructured":"Chen, X., Kovalev, S., Liu, Y., Sterna, M., Chalamon, I., & B\u0142a\u017cewicz, J. (2021). Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discrete Applied Mathematics, 290, 71\u201378.","journal-title":"Discrete Applied Mathematics"},{"key":"6290_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0898-1221(87)90136-2","volume":"14","author":"TCE Cheng","year":"1987","unstructured":"Cheng, T. C. E. (1987). Minimizing the maximum deviation of job completion times about a common due-date. Computers and Mathematics with Applications, 14, 279\u2013283.","journal-title":"Computers and Mathematics with Applications"},{"key":"6290_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2020.08.033","volume":"290","author":"AE Falq","year":"2021","unstructured":"Falq, A. E., Fouilhoux, P., & Kedad-Sidhoum, S. (2021). Mixed integer formulations using natural variables for single machine scheduling around a common due date. Discrete Applied Mathematics, 290, 36\u201359.","journal-title":"Discrete Applied Mathematics"},{"key":"6290_CR4","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. (2013). Minmax due-date assignment with a time window for acceptable lead-times. Annals of Operations Research, 211, 167\u2013177.","journal-title":"Annals of Operations Research"},{"key":"6290_CR5","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. (2021). The single machine CON problem with unavailability period. International Journal of Production Research, 59, 824\u2013838.","journal-title":"International Journal of Production Research"},{"key":"6290_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. (2017). Minmax scheduling with acceptable lead-times: Extensions to position-dependent processing times, due-window and job rejection. Computers and Operations Research, 83, 150\u2013156.","journal-title":"Computers and Operations Research"},{"key":"6290_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon, V., Proth, J.-M., & Chu, C. (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1\u201325.","journal-title":"European Journal of Operational Research"},{"key":"6290_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/09537280110069621","volume":"13","author":"V Gordon","year":"2002","unstructured":"Gordon, V., Proth, J.-M., & Chu, C. (2002b). Due date assignment and scheduling: SLK, TWK and other due-date assignment models. Production, Planning and Control, 13, 117\u2013132.","journal-title":"Production, Planning and Control"},{"key":"6290_CR8","volume-title":"Handbook of scheduling: Algorithms, models and performance measures","author":"V Gordon","year":"2004","unstructured":"Gordon, V., Proth, J.-M., & Strusevich, V. (2004). Scheduling with due date assignment. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance measures. New York: Chapman and Hall\/CRC Press."},{"key":"6290_CR9","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. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544\u2013546.","journal-title":"Management Science"},{"issue":"1","key":"6290_CR10","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. (2020). Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Engineering Optimization, 52(1), 74\u201389.","journal-title":"Engineering Optimization"},{"key":"6290_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-021-04212-y","volume":"305","author":"B Mor","year":"2021","unstructured":"Mor, B., & Mosheiov, G. (2021). Minmax due-date assignment on a two-machine flowshop. Annals of Operations Research, 305, 191\u2013209.","journal-title":"Annals of Operations Research"},{"key":"6290_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. (2013). A note: Minmax due-date assignment problem with lead-time cost. Computers and Operations Research, 40, 2161\u20132164.","journal-title":"Computers and Operations Research"},{"key":"6290_CR13","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. (2021). On the minmax common-due-date problem: Extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Engineering Optimization, 53, 408\u2013424.","journal-title":"Engineering Optimization"},{"key":"6290_CR14","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. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391\u2013399.","journal-title":"Operations Research"},{"key":"6290_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-021-01843-9","volume":"16","author":"J Qian","year":"2022","unstructured":"Qian, J., & Chang, G. (2022). A note on study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optimization Letters, 16, 1\u20134.","journal-title":"Optimization Letters"},{"key":"6290_CR16","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. (1981). Optimal assignment of due-dates for a single processor scheduling problem. International Joural of Production Research, 19, 393\u2013399.","journal-title":"International Joural of Production Research"},{"key":"6290_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2022.02.017","volume":"303","author":"D Shabtay","year":"2022","unstructured":"Shabtay, D., Mosheiov, G., & Oron, D. (2022). Single machine scheduling with common assignable due date\/due window to minimize total weighted early and late work. European Journal of Operational Research, 303, 66\u201377.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6290_CR18","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1080\/0305215X.2020.1740921","volume":"53","author":"JB Wang","year":"2021","unstructured":"Wang, J. B., Hu, Y., & Zhang, B. (2021). Common due-window assignment for single-machine scheduling with generalized earliness\/tardiness penalties and a rate-modifying activity. Engineering Optimization, 53(3), 496\u2013512.","journal-title":"Engineering Optimization"},{"key":"6290_CR19","doi-asserted-by":"crossref","unstructured":"Yang, Y., Yin, G., Wang, C., & Yin, Y. (2020). Due date assignment and two-agent scheduling under multitasking environment. Journal of Combinatorial Optimization, 1\u201317.","DOI":"10.1109\/IESM45758.2019.8948203"},{"key":"6290_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10479-018-2839-6","volume":"298","author":"Y Yin","year":"2021","unstructured":"Yin, Y., Li, D., Wang, D., & Cheng, T. C. E. (2021). Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Annals of Operations Research, 298, 497\u2013523.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06290-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06290-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06290-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:09:35Z","timestamp":1733515775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06290-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6290"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06290-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,4]]},"assertion":[{"value":"25 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2024","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, and no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}