{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:34:33Z","timestamp":1740123273234,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10479-021-04212-y","type":"journal-article","created":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T14:03:01Z","timestamp":1629208981000},"page":"191-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Minmax due-date assignment on a two-machine flowshop"],"prefix":"10.1007","volume":"305","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-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"4212_CR1","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.1057\/jors.1996.155","volume":"47","author":"GI 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"},{"issue":"3","key":"4212_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0305-0548(02)00225-3","volume":"31","author":"M Birman","year":"2004","unstructured":"Birman, M., & Mosheiov, G. (2004). A note on a due-date assignment on a two-machine flow-shop. Computers & Operations Research, 31(3), 473\u2013480.","journal-title":"Computers & Operations Research"},{"key":"4212_CR3","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 time about a common due-date. Comp. and Math. with Applications, 14, 279\u2013283.","journal-title":"Comp. and Math. with Applications"},{"key":"4212_CR4","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 & Operations Research, 83, 150\u2013156.","journal-title":"Computers & Operations Research"},{"key":"4212_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. (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":"4212_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"VS 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":"4212_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.ejor.2014.09.043","volume":"242","author":"A Janiak","year":"2015","unstructured":"Janiak, A., Janiak, W. A., Krysiak, T., & Kwiatkowski, T. (2015). A survey on scheduling problems with due windows. European Journal of Operational Research, 242, 347\u2013357.","journal-title":"European Journal of Operational Research"},{"key":"4212_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"4212_CR9","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1057\/jors.2011.135","volume":"63","author":"B Mor","year":"2012","unstructured":"Mor, B., & Mosheiov, G. (2012a). Minmax scheduling problems with common flow-allowance. Journal of the Operational Research Society, 63, 1284\u20131293.","journal-title":"Journal of the Operational Research Society"},{"key":"4212_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ijpe.2011.07.013","volume":"135","author":"B Mor","year":"2012","unstructured":"Mor, B., & Mosheiov, G. (2012b). 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":"4212_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor, B., & Mosheiov, G. (2016). Minsum and Minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research, 254, 360\u2013370.","journal-title":"European Journal of Operational Research"},{"key":"4212_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":"4212_CR13","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":"4212_CR14","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 Journal of Production Research, 19, 393\u2013399.","journal-title":"International Journal of Production Research"},{"key":"4212_CR15","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. (2008). 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":"4212_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10479-020-03653-1","volume":"292","author":"X Sun","year":"2020","unstructured":"Sun, X., Geng, X. N., & Liu, T. (2020). Due-window assignment scheduling in the proportionate flow shop setting. Annals of Operations Research, 292, 113\u2013131.","journal-title":"Annals of Operations Research"},{"key":"4212_CR17","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"},{"key":"4212_CR18","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin, Y., Wang, D.-J., Wu, C.-C., & Cheng, T. C. E. (2016). CON\/SLK due date assignment and scheduling on a single machine with two agents. Naval Research Logistics, 63, 416\u2013429.","journal-title":"Naval Research Logistics"},{"key":"4212_CR19","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1057\/jors.2015.107","volume":"67","author":"Q Yue","year":"2016","unstructured":"Yue, Q., & Wan, G. (2016). Single machine SLK\/DIF due window assignment problem with job-dependent linear deterioration effects. Journal of the Operational Research Society, 67, 872\u2013883.","journal-title":"Journal of the Operational Research Society"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04212-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04212-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04212-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T14:29:39Z","timestamp":1631629779000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04212-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["4212"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04212-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,8,17]]},"assertion":[{"value":"19 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}