{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:02:23Z","timestamp":1776128543144,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"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":[[2025,4]]},"DOI":"10.1007\/s10479-025-06468-0","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T07:50:00Z","timestamp":1737618600000},"page":"1455-1471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling problems on parallel machines with machine-dependent generalized due-dates"],"prefix":"10.1007","volume":"347","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-599X","authenticated-orcid":false,"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"key":"6468_CR1","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. (2023). Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity. Computers & Operations Research, 152, 106133.","journal-title":"Computers & Operations Research"},{"key":"6468_CR2","doi-asserted-by":"crossref","unstructured":"Chen, R., Gao, Y., Geng, Z., & Yuan, J. (2022). Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. International Journal of Production Research, 1\u201319.","DOI":"10.1080\/00207543.2022.2160502"},{"key":"6468_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2022.03.002","volume":"314","author":"BC Choi","year":"2022","unstructured":"Choi, B. C., Kim, K. M., Min, Y., & Park, M. J. (2022a). A single machine scheduling with generalized and periodic due dates to minimize total deviation. Discrete Applied Mathematics, 314, 31\u201352.","journal-title":"Discrete Applied Mathematics"},{"key":"6468_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s11590-021-01739-8","volume":"16","author":"BC Choi","year":"2022","unstructured":"Choi, B. C., Kim, K. M., Min, Y., & Park, M. J. (2022b). Scheduling with generalized and periodic due dates under single-and two-machine environments. Optimization Letters, 16, 623\u2013633.","journal-title":"Optimization Letters"},{"issue":"10","key":"6468_CR5","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1080\/0305215X.2021.2014477","volume":"54","author":"BC Choi","year":"2022","unstructured":"Choi, B. C., Park, M. J., & Min Kim, K. (2022c). Min\u2013max version of single-machine scheduling with generalized due dates under scenario-based uncertainty. Engineering Optimization, 54(10), 1773\u20131786.","journal-title":"Engineering Optimization"},{"issue":"3","key":"6468_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","volume":"9","author":"HN Gabow","year":"1988","unstructured":"Gabow, H. N., & Tarjan, R. E. (1988). Algorithms for two bottleneck optimization problems. Journal of Algorithms, 9(3), 411\u2013417.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"6468_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10951-020-00638-7","volume":"23","author":"E Gerstl","year":"2020","unstructured":"Gerstl, E., & Mosheiov, G. (2020). Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. Journal of Scheduling, 23(3), 289\u2013299.","journal-title":"Journal of Scheduling"},{"key":"6468_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-024-02138-5","author":"E Gerstl","year":"2024","unstructured":"Gerstl, E., & Mosheiov, G. (2024). Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times. Optimization Letters. https:\/\/doi.org\/10.1007\/s11590-024-02138-5","journal-title":"Optimization Letters"},{"issue":"2","key":"6468_CR9","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N. G. (1986). Scheduling problems with generalized due dates. IIE Transactions, 18(2), 220\u2013222.","journal-title":"IIE Transactions"},{"issue":"1","key":"6468_CR10","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. (1991). On the complexity of generalized due date scheduling problems. European Journal of Operational Research, 51(1), 100\u2013109.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"6468_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1\u20132), 83\u201397.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"6468_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HL Lenstra","year":"1983","unstructured":"Lenstra, H. L. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4), 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"issue":"7","key":"6468_CR13","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. (2020). Scheduling with common due date assignment to minimize generalized weighted earliness\u2013tardiness penalties. Optimization Letters, 14(7), 1681\u20131699.","journal-title":"Optimization Letters"},{"issue":"6","key":"6468_CR14","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. (2021). Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates. Journal of Scheduling, 24(6), 553\u2013567.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"6468_CR15","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. (2004). A note on the SPT heuristic for solving scheduling problems with generalized due dates. Computers & Operations Research, 31(5), 645\u2013655.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6468_CR16","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. (2021). Minimizing total late work on a single machine with generalized due-dates. European Journal of Operational Research, 293(3), 837\u2013846.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6468_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s10951-022-00743-9","volume":"25","author":"G Mosheiov","year":"2022","unstructured":"Mosheiov, G., Oron, D., & Shabtay, D. (2022). On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates. Journal of Scheduling, 25(5), 577\u2013587.","journal-title":"Journal of Scheduling"},{"issue":"01","key":"6468_CR18","doi-asserted-by":"publisher","first-page":"1950032","DOI":"10.1142\/S0217595919500325","volume":"37","author":"MJ Park","year":"2020","unstructured":"Park, M. J., Choi, B. C., Min, Y., & Kim, K. M. (2020). Two-machine ordered flow shop scheduling with generalized due dates. Asia-Pacific Journal of Operational Research, 37(01), 1950032.","journal-title":"Asia-Pacific Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-025-06468-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-025-06468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T16:23:04Z","timestamp":1746721384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-025-06468-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["6468"],"URL":"https:\/\/doi.org\/10.1007\/s10479-025-06468-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,23]]},"assertion":[{"value":"16 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","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 declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}