{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:09:16Z","timestamp":1760710156936,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:00:00Z","timestamp":1583452800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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":["J Sched"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10951-020-00638-7","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T19:02:47Z","timestamp":1583521367000},"page":"289-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Single machine scheduling to maximize the number of on-time jobs with generalized due-dates"],"prefix":"10.1007","volume":"23","author":[{"given":"Enrique","family":"Gerstl","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":[[2020,3,6]]},"reference":[{"key":"638_CR1","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. (1990). Minimizing total tardiness on one processor is np-hard. Mathematics of Operations Research,15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"638_CR2","first-page":"3164","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalized due-dates and job-rejection. International Journal of Operations Research,55, 3164\u20133172.","journal-title":"International Journal of Operations Research"},{"key":"638_CR3","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N. G. (1986). Scheduling Mathematics of Operations Research problems with generalized due dates. IIE Transactions,18, 220\u2013222.","journal-title":"IIE Transactions"},{"key":"638_CR4","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, 100\u2013109.","journal-title":"European Journal of Operational Research"},{"key":"638_CR5","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early\/tardy jobs. Computers and Operations Research,23, 769\u2013781.","journal-title":"Computers and Operations Research"},{"key":"638_CR6","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"},{"key":"638_CR7","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 and Operations Research,31, 645\u2013655.","journal-title":"Computers and Operations Research"},{"key":"638_CR8","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. (2002). Single machine scheduling with assignable due dates. Discrete Applied Mathematics,122, 211\u2013233.","journal-title":"Discrete Applied Mathematics"},{"key":"638_CR9","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O","volume":"37","author":"C Sriskandarajah","year":"1990","unstructured":"Sriskandarajah, C. (1990). A note on the generalized due dates scheduling problems. Naval Research Logistics,37, 587\u2013597.","journal-title":"Naval Research Logistics"},{"key":"638_CR10","first-page":"557","volume":"80","author":"K Tanaka","year":"1997","unstructured":"Tanaka, K., & Vlach, M. (1997). Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,80, 557\u2013563.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"638_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1023\/A:1018987625819","volume":"86","author":"K Tanaka","year":"1999","unstructured":"Tanaka, K., & Vlach, M. (1999). Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine. Annals of Operations Research,86, 507\u2013526.","journal-title":"Annals of Operations Research"},{"key":"638_CR12","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. R., Cheng, T. C. E., Wu, C. C., & Wu, W. H. (2012). Two-agent single-machine scheduling with assignable due dates. Applied Mathematics and Computation,219, 1674\u20131685.","journal-title":"Applied Mathematics and Computation"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00638-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-020-00638-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00638-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T00:21:20Z","timestamp":1614990080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-020-00638-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,6]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["638"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00638-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2020,3,6]]},"assertion":[{"value":"6 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}