{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:05:46Z","timestamp":1767924346020,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10878-023-01025-6","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T12:22:16Z","timestamp":1681993336000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs"],"prefix":"10.1007","volume":"45","author":[{"given":"Lei","family":"Pan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6518-6411","authenticated-orcid":false,"given":"Xinyu","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2271-6459","authenticated-orcid":false,"given":"Ji-Bo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Han","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan-Yang","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"1025_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker P (2001) Scheduling algorithms, 3rd edn. Springer, Berlin","edition":"3"},{"key":"1025_CR2","doi-asserted-by":"crossref","unstructured":"Chen Y, Ma X, Zhang G, Cheng Y (2023) On optimal due date assignment without restriction and resource allocation in group technology scheduling. J Comb Optim 45:64","DOI":"10.1007\/s10878-023-00993-z"},{"key":"1025_CR3","doi-asserted-by":"publisher","first-page":"106329","DOI":"10.1016\/j.cie.2020.106329","volume":"144","author":"TCE Cheng","year":"2020","unstructured":"Cheng TCE, Kravchenko SA, Lin BMT (2020) Scheduling step-deteriorating jobs to minimize the total completion time. Comput Ind Eng 144:106329","journal-title":"Comput Ind Eng"},{"key":"1025_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-59362-2","volume-title":"Models and algorithms of time-dependent scheduling","author":"S Gawiejnowicz","year":"2020","unstructured":"Gawiejnowicz S (2020) Models and algorithms of time-dependent scheduling. Springer, Berlin"},{"key":"1025_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"VS Gordon","year":"2002","unstructured":"Gordon VS, Proth JM, Chu CB (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":"1025_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/09537280110069621","volume":"13","author":"VS Gordon","year":"2002","unstructured":"Gordon VS, Proth JM, Chu CB (2002) Due date assignment and scheduling: SLK, TWK and other due date assignment models. Prod Plan Control 13:117\u2013132","journal-title":"Prod Plan Control"},{"key":"1025_CR7","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1504\/EJIE.2015.074380","volume":"9","author":"M Ji","year":"2015","unstructured":"Ji M, Ge Yao DL, JJ, Cheng TCE (2015) Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times. Eur J Ind Eng 9:794\u2013818","journal-title":"Eur J Ind Eng"},{"issue":"1","key":"1025_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/0305215X.2019.1573898","volume":"52","author":"C Jiang","year":"2020","unstructured":"Jiang C, Zou D, Bai D, Wang J-B (2020) Proportionate flowshop scheduling with position-dependent weights. Eng Optim 52(1):37\u201352","journal-title":"Eng Optim"},{"key":"1025_CR9","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":"1025_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ijpe.2010.03.016","volume":"126","author":"C Koulamas","year":"2010","unstructured":"Koulamas C, Kyparisis GJ (2010) Single-machine scheduling problems with past-sequence-dependent delivery times. Int J Prod Econ 126:264\u2013266","journal-title":"Int J Prod Econ"},{"key":"1025_CR11","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s10878-019-00429-7","volume":"38","author":"S-S Li","year":"2019","unstructured":"Li S-S, Chen R-X, Feng Q, Jiao C-W (2019) Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. J Comb Optim 38:957\u2013971","journal-title":"J Comb Optim"},{"key":"1025_CR12","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/0305215X.2016.1197611","volume":"49","author":"W Liu","year":"2017","unstructured":"Liu W, Hu X, Wang X (2017) Single machine scheduling with slack due dates assignment. Eng Optim 49:709\u2013717","journal-title":"Eng Optim"},{"key":"1025_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/0305215X.2019.1608980","volume":"52","author":"W-W Liu","year":"2020","unstructured":"Liu W-W, Yao Y, Jiang C (2020) Single-machine resource allocation scheduling with due-date assignment, deterioration effect and position-dependent weights. Eng Optim 52:701\u2013714","journal-title":"Eng Optim"},{"issue":"6","key":"1025_CR14","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1007\/s11590-020-01670-4","volume":"15","author":"D-Y Lv","year":"2021","unstructured":"Lv D-Y, Wang J-B (2021) Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights. Optim Lett 15(6):2311\u20132319","journal-title":"Optim Lett"},{"key":"1025_CR15","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1007\/s12190-021-01607-9","volume":"68","author":"J Qian","year":"2022","unstructured":"Qian J, Han H (2022) The due date assignment scheduling problem with the deteriorating jobs and delivery time. J Appl Math Comput 68:2173\u20132186","journal-title":"J Appl Math Comput"},{"key":"1025_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. Ann Oper Res 292:113\u2013131","journal-title":"Ann Oper Res"},{"key":"1025_CR17","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/s10878-019-00512-z","volume":"39","author":"V T\u2019kindt","year":"2020","unstructured":"T\u2019kindt V, Shang L, Croce FD (2020) Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights. J Comb Optim 39:764\u2013775","journal-title":"J Comb Optim"},{"key":"1025_CR18","doi-asserted-by":"crossref","unstructured":"Toksari, MD, Guner, E (2010) The common due-date early\/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst Appl 37:92\u2013112","DOI":"10.1016\/j.eswa.2009.05.014"},{"issue":"2","key":"1025_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1080\/0305215X.2019.1577411","volume":"52","author":"J-B Wang","year":"2020","unstructured":"Wang J-B, Zhang B, Li L, Bai D-Y, Feng Y-B (2020) Due-window assignment scheduling problems with position-dependent weights on a single machine. Eng Optim 52(2):185\u2013193","journal-title":"Eng Optim"},{"key":"1025_CR20","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s10878-020-00676-z","volume":"41","author":"J-B Wang","year":"2021","unstructured":"Wang J-B, Cui B, Ji P, Liu W-W (2021) Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times. J Comb Optim 41:290\u2013303","journal-title":"J Comb Optim"},{"issue":"3","key":"1025_CR21","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(3):1345\u20131360","journal-title":"Int J Prod Res"},{"issue":"4","key":"1025_CR22","doi-asserted-by":"publisher","first-page":"2207","DOI":"10.1007\/s10878-020-00600-5","volume":"44","author":"Y Yang","year":"2022","unstructured":"Yang Y, Yin G, Wang C, Yin Y (2022) Due date assignment and two-agent scheduling under multitasking environment. J Comb Optim 44(4):2207\u20132223","journal-title":"J Comb Optim"},{"key":"1025_CR23","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1080\/00207543.2013.855833","volume":"52","author":"Y Yin","year":"2014","unstructured":"Yin Y, Wu W-H, Cheng TCE, Wu C-C (2014) Due date assignment and single-machine scheduling with generalized positional deteriorating jobs and deteriorating multi-maintenance activities. Int J Prod Res 52:2311\u20132326","journal-title":"Int J Prod Res"},{"key":"1025_CR24","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1002\/nav.21700","volume":"63","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang D, Wu C-C, Cheng TCE (2016) CON\/SLK due date assignment and scheduling on a single machine with two agents. Nav Res Logist 63:416\u2013429","journal-title":"Nav Res Logist"},{"key":"1025_CR25","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/nav.21813","volume":"65","author":"Y Yin","year":"2018","unstructured":"Yin Y, Yang Y, Wang D, Cheng TCE, Wu C-C (2018) Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Nav Res Logist 65:393\u2013409","journal-title":"Nav Res Logist"},{"key":"1025_CR26","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 TCE (2021) Single-machine serial-batch delivery scheduling with two competing agents and due date assignment. Ann Oper Res 298:497\u2013523","journal-title":"Ann Oper Res"},{"key":"1025_CR27","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12190-013-0722-9","volume":"45","author":"CL Zhao","year":"2014","unstructured":"Zhao CL, Tang HY (2014) Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times. J Appl Math Comput 45:259\u2013274","journal-title":"J Appl Math Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01025-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01025-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01025-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T03:41:20Z","timestamp":1685158880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01025-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1025"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01025-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"24 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"100"}}