{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:08:47Z","timestamp":1768532927154,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10878-021-00709-1","type":"journal-article","created":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T06:02:52Z","timestamp":1614578572000},"page":"327-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A note on the single machine CON and CONW problems with lot scheduling"],"prefix":"10.1007","volume":"42","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-2824-8214","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,1]]},"reference":[{"key":"709_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10951-018-0585-x","volume":"22","author":"K Bulbul","year":"2019","unstructured":"Bulbul K, Kedad Sidhoum S, Sen H (2019) Single machine common due date total earliness\/tardiness scheduling with machine availability. J Sched 22:543\u2013565","journal-title":"J Sched"},{"key":"709_CR2","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-P, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139:1\u201325","journal-title":"Eur J Oper Res"},{"key":"709_CR3","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.ipl.2014.06.016","volume":"114","author":"Y-T Hou","year":"2014","unstructured":"Hou Y-T, Yang D-L, Kuo W-H (2014) Lot scheduling on a single machine. Inf Process Lett 114:718\u2013722","journal-title":"Inf Process Lett"},{"key":"709_CR4","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 WA, Krysiak T, Kwiatkowski T (2015) A survey on scheduling problems with due windows. Eur J Oper Res 242:347\u2013357","journal-title":"Eur J Oper Res"},{"key":"709_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2017.04.040","volume":"109","author":"C Koulamas","year":"2017","unstructured":"Koulamas C (2017) Common due date assignment with generalized earliness\/tardiness penalties. Comput Ind Eng 109:79\u201383","journal-title":"Comput Ind Eng"},{"key":"709_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"SD Liman","year":"1996","unstructured":"Liman SD, Panwalkar SS, Thongmee S (1996) Determination of common due window location in a single machine scheduling problem. Eur J Oper Res 93:68\u201374","journal-title":"Eur J Oper Res"},{"key":"709_CR7","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"SD Liman","year":"1998","unstructured":"Liman SD, Panwalkar SS, Thongmee S (1998) Common due window size and location determination in a single machine scheduling problem. J Oper Res Soc 49:1007\u20131010","journal-title":"J Oper Res Soc"},{"key":"709_CR8","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1057\/s41274-017-0253-0","volume":"69","author":"B Mor","year":"2017","unstructured":"Mor B (2017) Minmax common due-window assignment and scheduling on a single machine with two competing agents. J Oper Res Soc 69:589\u2013602","journal-title":"J Oper Res Soc"},{"key":"709_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10878-018-0365-8","volume":"38","author":"B Mor","year":"2019","unstructured":"Mor B (2019) Minmax scheduling problems with common due-date and completion time penalty. J Comb Optim 38:50\u201371","journal-title":"J Comb Optim"},{"key":"709_CR10","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1007\/s10878-016-0049-1","volume":"33","author":"B Mor","year":"2017","unstructured":"Mor B, Mosheiov G (2017) A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. J Comb Optim 33:1454\u20131468","journal-title":"J Comb Optim"},{"issue":"2","key":"709_CR100","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1080\/0305215X.2020.1722119","volume":"53","author":"B Mor","year":"2021","unstructured":"Mor B (2021) Single-machine lot scheduling with variable lot processing times. Eng Optim 53(2):321\u2013334","journal-title":"Eng Optim"},{"key":"709_CR101","doi-asserted-by":"publisher","first-page":"106009","DOI":"10.1016\/j.ipl.2020.106009","volume":"164","author":"B Mor","year":"2020","unstructured":"Mor B, Mosheiov G, Shapira D (2020) Lot scheduling on a single machine to minimize the (weighted) number of tardy orders. Inf Process Lett 164:106009","journal-title":"Inf Process Lett"},{"issue":"1","key":"709_CR102","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-020-00651-8","volume":"41","author":"B Mor","year":"2021","unstructured":"Mor B, Mosheiov G, Shapira D (2021) Single machine lot scheduling with optional job-rejection. J Comb Optim 41(1):1\u201311","journal-title":"J Comb Optim"},{"key":"709_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"SS Panwalkar","year":"1982","unstructured":"Panwalkar SS, Smith ML, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391\u2013399","journal-title":"Oper Res"},{"key":"709_CR12","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2019.1604698","author":"H-B Shi","year":"2019","unstructured":"Shi H-B, Wang J-B (2019) Research on common due window assignment flowshop scheduling with learning effect and resource allocation. Eng Optim. https:\/\/doi.org\/10.1080\/0305215X.2019.1604698","journal-title":"Eng Optim"},{"key":"709_CR13","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1080\/00207543.2017.1346317","volume":"56","author":"X Xiong","year":"2018","unstructured":"Xiong X, Wang D, Cheng TCE, Wu C-C, Yin Y (2018) Single-machine scheduling and common due date assignment with potential machine disruption. Int J Prod Res 56:1345\u20131360","journal-title":"Int J Prod Res"},{"key":"709_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.ipl.2018.10.002","volume":"142","author":"E Zhang","year":"2019","unstructured":"Zhang E, Liu M, Zheng F, Xu Y (2019a) Single machine lot scheduling to minimize the total weighted (discounted) completion time. Inf Process Lett 142:46\u201351","journal-title":"Inf Process Lett"},{"key":"709_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-017-0228-8","volume":"37","author":"L Zhang","year":"2019","unstructured":"Zhang L, Zhang Y, Bai Q (2019b) Two-stage medical supply chain scheduling with an assignable common due-window and shelf life. J Comb Optim 37:319\u2013329","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00709-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00709-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00709-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T18:50:08Z","timestamp":1629485408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00709-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["709"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00709-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,1]]},"assertion":[{"value":"6 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}