{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:55:36Z","timestamp":1762005336213,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["NRF-2018S1A5B8070344"],"award-info":[{"award-number":["NRF-2018S1A5B8070344"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s11590-021-01739-8","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T21:15:14Z","timestamp":1618521314000},"page":"623-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scheduling with generalized and periodic due dates under single- and two-machine environments"],"prefix":"10.1007","volume":"16","author":[{"given":"Byung-Cheon","family":"Choi","sequence":"first","affiliation":[]},{"given":"Kyung Min","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Yunhong","family":"Min","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3382-6514","authenticated-orcid":false,"given":"Myoung-Ju","family":"Park","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"1739_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.orl.2019.08.002","volume":"47","author":"BC Choi","year":"2019","unstructured":"Choi, B.C., Min, Y., Park, M.J.: Strong NP-hardness of minimizing total deviation with generalized and periodic due dates. Oper. Res. Lett. 47, 433\u2013437 (2019)","journal-title":"Oper. Res. Lett."},{"key":"1739_CR2","doi-asserted-by":"publisher","first-page":"185004647","DOI":"10.1142\/S021759591850046X","volume":"35","author":"BC Choi","year":"2018","unstructured":"Choi, B.C., Park, M.J.: Just-in-time scheduling with generalized due dates and identical due date intervals. Asia-Pac. J. Oper. Res. 35, 185004647 (2018)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"1739_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"1739_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MP Garey","year":"1976","unstructured":"Garey, M.P., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"1739_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"3","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., RinnooyKan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 3, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"1739_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.dam.2015.03.011","volume":"189","author":"Y Gao","year":"2015","unstructured":"Gao, Y., Yuan, J.: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates. Discrete Appl. Math. 189, 49\u201352 (2015)","journal-title":"Discrete Appl. Math."},{"key":"1739_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.orl.2015.12.006","volume":"44","author":"Y Gao","year":"2016","unstructured":"Gao, Y., Yuan, J.: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates. Oper. Res. Lett. 44, 92\u201395 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1739_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N.G.: Scheduling problems with generalized due dates. IIE Trans. 18, 220\u2013222 (1986)","journal-title":"IIE Trans."},{"key":"1739_CR9","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.39.5.847","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Oper. Res. 39, 847\u2013856 (1991)","journal-title":"Oper. Res."},{"key":"1739_CR10","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1287\/opre.49.1.134.11192","volume":"49","author":"NG Hall","year":"2001","unstructured":"Hall, N.G., Lesaoana, M., Potts, C.N.: Scheduling with fixed delivery dates. Oper. Res. 49, 134\u2013144 (2001)","journal-title":"Oper. Res."},{"key":"1739_CR11","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"NG Hall","year":"1991","unstructured":"Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date. Oper. Res. 39, 836\u2013846 (1991)","journal-title":"Oper. Res."},{"key":"1739_CR12","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.: On the complexity of generalized due date scheduling problems. Eur. J. Oper. Res. 51, 100\u2013109 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"1739_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1, 61\u201368 (1954)","journal-title":"Naval Res. Logist. Quart."},{"key":"1739_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","volume":"16","author":"J J\u00f3zefowska","year":"1994","unstructured":"J\u00f3zefowska, J., Jurisch, B., Kubiak, W.: Scheduling shops to minimize the weighted number of late jobs. Oper. Res. Lett. 16, 277\u2013283 (1994)","journal-title":"Oper. Res. Lett."},{"key":"1739_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler, E.L., Moore, J.M.: A functional equation and its application to resource allocation and sequencing problems. Manag. Sci. 16, 77\u201384 (1969)","journal-title":"Manag. Sci."},{"key":"1739_CR16","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.: Two-machine ordered flow shop scheduling with generalized due dates. Asia Pac. J. Oper. Res. 37, 1950032 (2020)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1739_CR17","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":"S Srikandarajah","year":"1990","unstructured":"Srikandarajah, S.: A note on the generalized due dates scheduling problem. Naval Res. Logist. 37, 587\u2013597 (1990)","journal-title":"Naval Res. Logist."},{"key":"1739_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.orl.2013.04.007","volume":"41","author":"L Wan","year":"2013","unstructured":"Wan, L., Yuan, J.: Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. Oper. Res. Lett. 41, 363\u2013365 (2013)","journal-title":"Oper. Res. Lett."},{"key":"1739_CR19","first-page":"328","volume":"5","author":"J Yuan","year":"1992","unstructured":"Yuan, J.: The NP-hardness of the single machine common due date weighted tardiness problem. J. Syst. Sci. Complex. 5, 328\u2013333 (1992)","journal-title":"J. Syst. Sci. Complex."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01739-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01739-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01739-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T13:27:36Z","timestamp":1645018056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01739-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1739"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01739-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,4,15]]},"assertion":[{"value":"16 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}