{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T22:17:22Z","timestamp":1772057842960,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701595"],"award-info":[{"award-number":["11701595"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Backbone Teachers training program of Zhongyuan University of Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-019-01462-5","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T09:29:19Z","timestamp":1565602159000},"page":"1681-1699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Scheduling with common due date assignment to minimize generalized weighted earliness\u2013tardiness penalties"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren-Xia","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"1462_CR1","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1287\/moor.23.3.649","volume":"33","author":"T Badics","year":"1998","unstructured":"Badics, T., Boros, E.: Minimization of half-products. Math. Oper. Res. 33, 649\u2013660 (1998)","journal-title":"Math. Oper. Res."},{"key":"1462_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38, 22\u201336 (1990)","journal-title":"Oper. Res."},{"key":"1462_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2010.10.033","volume":"210","author":"K Chakhlevitch","year":"2011","unstructured":"Chakhlevitch, K., Glass, C.A., Kellerer, H.: Batch machine production with perishability time windows and limited batch size. Eur. J. Oper. Res. 210, 39\u201347 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1462_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"TCE Cheng","year":"1989","unstructured":"Cheng, T.C.E., Gupta, M.C.: Survey of scheduling research involving due date determination decisions. Eur. J. Oper. Res. 38, 156\u2013166 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"1462_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1111\/j.1540-5915.1991.tb00353.x","volume":"22","author":"P De","year":"1991","unstructured":"De, P., Ghosh, J.B., Wells, C.E.: Optimal delivery time quotation and order sequencing. Decis. Sci. 22, 379\u2013390 (1991)","journal-title":"Decis. Sci."},{"key":"1462_CR6","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","volume":"40","author":"P De","year":"1992","unstructured":"De, P., Ghosh, J.B., Wells, C.E.: On the minimization of completion time variance with a bicriteria extension. Oper. Res. 40, 1148\u20131155 (1992)","journal-title":"Oper. Res."},{"key":"1462_CR7","doi-asserted-by":"publisher","first-page":"3046","DOI":"10.1016\/j.dam.2008.01.018","volume":"156","author":"E Erel","year":"2008","unstructured":"Erel, E., Ghosh, J.B.: FPTAS for half-products minimization with scheduling applications. Discrete Appl. Math. 156, 3046\u20133056 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1462_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of $$\\cal{NP}$$-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $$\\cal{NP}$$-Completeness. Freeman, San Francisco (1979)"},{"key":"1462_CR9","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.B.: A survey of the state-of-the art of common due date assignment and scheduling research. Eur. J. Oper. Res. 139, 1\u201325 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"1462_CR10","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"VS Gordon","year":"2004","unstructured":"Gordon, V.S., Proth, J.M., Strusevich, V.A.: Scheduling with due date assignment. In: Leung, J.Y.T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"key":"1462_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":"1462_CR12","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., Krysiak, T., Kwiatkowski, T.: A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242, 347\u2013357 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1462_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(93)90088-6","volume":"47","author":"HG Kahlbacher","year":"1993","unstructured":"Kahlbacher, H.G., Cheng, T.C.E.: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs. Discrete Appl. Math. 47, 139\u2013164 (1993)","journal-title":"Discrete Appl. Math."},{"key":"1462_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.11.001","author":"H Kellerer","year":"2019","unstructured":"Kellerer, H., Rustogi, K., Strusevich, V.A.: A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date. Omega (2019). \nhttps:\/\/doi.org\/10.1016\/j.omega.2018.11.001","journal-title":"Omega"},{"key":"1462_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054110007301","volume":"21","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., Strusevich, V.A.: Minimizing total weighted earliness\u2013tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. Int. J. Found. Comput. Sci. 21, 357\u2013383 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1462_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-015-2018-y","volume":"240","author":"H Kellerer","year":"2016","unstructured":"Kellerer, H., Strusevich, V.A.: Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications. Ann. Oper. Res. 240, 39\u201394 (2016)","journal-title":"Ann. Oper. Res."},{"key":"1462_CR17","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.ijpe.2011.04.023","volume":"132","author":"C Koulamas","year":"2011","unstructured":"Koulamas, C.: A unified solution approach for the due date assignment problem with tardy jobs. Int. J. Prod. Econ. 132, 292\u2013295 (2011)","journal-title":"Int. J. Prod. Econ."},{"key":"1462_CR18","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.: Common due date assignment with generalized earliness\/tardiness penalties. Comput. Ind. Eng. 109, 79\u201383 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"1462_CR19","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1287\/opre.47.5.757","volume":"47","author":"MY Kovalyov","year":"1999","unstructured":"Kovalyov, M.Y., Kubiak, K.: A fully polynomial approximation scheme for weighted earliness\u2013tardiness problem. Oper. Res. 47, 757\u2013761 (1999)","journal-title":"Oper. Res."},{"key":"1462_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","volume":"14","author":"W Kubiak","year":"1993","unstructured":"Kubiak, W.: Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. 14, 49\u201359 (1993)","journal-title":"Oper. Res. Lett."},{"key":"1462_CR21","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.: Single machine scheduling to minimize the number of early and tardy jobs. Comput. Oper. Res. 23, 769\u2013781 (1996)","journal-title":"Comput. Oper. Res."},{"key":"1462_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0305-0548(91)90098-C","volume":"18","author":"CY Lee","year":"1991","unstructured":"Lee, C.Y., Danusaputro, S.L., Lin, C.S.: Minimizing weighted number of tardy jobs and weighted earliness\u2013tardiness penalties about a common due date. Comput. Oper. Res. 18, 379\u2013389 (1991)","journal-title":"Comput. Oper. Res."},{"key":"1462_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0305-0548(94)E0012-V","volume":"22","author":"CL Li","year":"1995","unstructured":"Li, C.L., Cheng, T.C.E., Chen, Z.L.: Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. Comput. Oper. Res. 22, 205\u2013219 (1995)","journal-title":"Comput. Oper. Res."},{"key":"1462_CR24","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.cor.2007.07.007","volume":"36","author":"LL Liu","year":"2009","unstructured":"Liu, L.L., Ng, C.T., Cheng, T.C.E.: Bicriterion scheduling with equal processing times on a batch processing machine. Comput. Oper. Res. 36, 110\u2013118 (2009)","journal-title":"Comput. Oper. Res."},{"key":"1462_CR25","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/j.ejor.2004.10.021","volume":"172","author":"G Mosheiov","year":"2006","unstructured":"Mosheiov, G., Yovel, U.: Minimizing weighted earliness\u2013tardiness and due-date cost with unit processing-time jobs. Eur. J. Oper. Res. 172, 528\u2013544 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1462_CR26","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.: Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper. Res. 30, 391\u2013399 (1982)","journal-title":"Oper. Res."},{"key":"1462_CR27","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"1462_CR28","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.ejor.2010.01.016","volume":"205","author":"NH Tuong","year":"2010","unstructured":"Tuong, N.H., Soukhal, A.: Due dates assignment and JIT scheduling with equal-size jobs. Eur. J. Oper. Res. 205, 280\u2013289 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01462-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01462-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01462-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T13:05:25Z","timestamp":1600088725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01462-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1462"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01462-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,12]]},"assertion":[{"value":"9 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}