{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T15:06:29Z","timestamp":1744643189965},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,9,20]],"date-time":"2013-09-20T00:00:00Z","timestamp":1379635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10479-013-1458-5","type":"journal-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T08:40:32Z","timestamp":1379580032000},"page":"167-177","source":"Crossref","is-referenced-by-count":11,"title":["Minmax due-date assignment with a time window for acceptable lead-times"],"prefix":"10.1007","volume":"211","author":[{"given":"Enrique","family":"Gerstl","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,20]]},"reference":[{"key":"1458_CR1","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1057\/jors.1996.155","volume":"47","author":"G. I. Adamopoulos","year":"1996","unstructured":"Adamopoulos, G. I., & Pappis, C. P. (1996). Single machine scheduling with flow allowances. Journal of the Operational Research Society, 47, 1280\u20131285.","journal-title":"Journal of the Operational Research Society"},{"key":"1458_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K. R. Baker","year":"1990","unstructured":"Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Operations Research, 38, 22\u201336.","journal-title":"Operations Research"},{"key":"1458_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0898-1221(87)90136-2","volume":"14","author":"T. C. E. Cheng","year":"1987","unstructured":"Cheng, T. C. E. (1987). Minimizing the maximum deviation of job completion time about a common due-date. Computers & Mathematics with Applications, 14, 279\u2013283.","journal-title":"Computers & Mathematics with Applications"},{"key":"1458_CR4","unstructured":"Gerstl, E., & Mosheiov, G. (2012). Due-window assignment with lead-time cost. Working Paper, The Hebrew University."},{"key":"1458_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V. S. Gordon","year":"2002","unstructured":"Gordon, V. S., Proth, J.-M., & Chu, C. (2002). 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":"1458_CR6","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"S. D. Liman","year":"1998","unstructured":"Liman, S. D., Panwalkar, S. S., & Thongmee, S. (1998). Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society, 49, 1007\u20131010.","journal-title":"Journal of the Operational Research Society"},{"key":"1458_CR7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ijpe.2011.07.013","volume":"135","author":"B. Mor","year":"2012","unstructured":"Mor, B., & Mosheiov, G. (2012). Scheduling a maintenance activity and due-window assignment based on common flow allowance. International Journal of Production Economics, 135, 222\u2013230.","journal-title":"International Journal of Production Economics"},{"key":"1458_CR8","doi-asserted-by":"crossref","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 & Operations Research, 40, 2161\u20132164.","journal-title":"Computers & Operations Research"},{"key":"1458_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"S. S. 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":"1458_CR10","doi-asserted-by":"crossref","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 Journal of Production Research, 19, 393\u2013399.","journal-title":"International Journal of Production Research"},{"key":"1458_CR11","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.orl.2005.10.009","volume":"34","author":"D. Shabtay","year":"2006","unstructured":"Shabtay, D., & Steiner, G. (2006). Two due-date assignment problems in scheduling a single machine. Operations Research Letters, 34, 683\u2013691.","journal-title":"Operations Research Letters"},{"key":"1458_CR12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10479-007-0269-y","volume":"159","author":"D. Shabtay","year":"2008","unstructured":"Shabtay, D., & Steiner, G. (2008a). The single-machine earliness-tardiness scheduling problem with due-date assignment and resource-dependent processing times. Annals of Operations Research, 159, 25\u201340.","journal-title":"Annals of Operations Research"},{"key":"1458_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10951-007-0015-y","volume":"11","author":"D. Shabtay","year":"2008","unstructured":"Shabtay, D., & Steiner, G. (2008b). Optimal due date assignment in multi-machine scheduling environments. Journal of Scheduling, 11, 217\u2013228.","journal-title":"Journal of Scheduling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1458-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1458-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1458-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:45Z","timestamp":1559138985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1458-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,20]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["1458"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1458-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,20]]}}}