{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:48:23Z","timestamp":1774727303104,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72192830"],"award-info":[{"award-number":["72192830"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72192834"],"award-info":[{"award-number":["72192834"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10878-026-01397-5","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T05:56:31Z","timestamp":1772862991000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal due date assignment in a single machine group technology scheduling environment with learning effect"],"prefix":"10.1007","volume":"51","author":[{"given":"Ying","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yongxi","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-0899-3971","authenticated-orcid":false,"given":"Guiqing","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,7]]},"reference":[{"key":"1397_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1397_CR2","doi-asserted-by":"publisher","first-page":"2340007:1","DOI":"10.1142\/S0217595923400079","volume":"40","author":"Y Chen","year":"2023","unstructured":"Chen Y, Xu Y, Zhang G et al (2023) A single machine group scheduling problem with due date assignment and position-dependent costs. Asia-Pacific Journal of Operational Research 40(4):2340007:1-2340007:20","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"1397_CR3","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10878-021-00714-4","volume":"41","author":"B Choi","year":"2021","unstructured":"Choi B, Park M (2021) Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty. J Comb Optim 41:781\u2013793","journal-title":"J Comb Optim"},{"key":"1397_CR4","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s11590-023-02039-z","volume":"18","author":"Y Feng","year":"2024","unstructured":"Feng Y, Geng XN, Lv DY et al (2024) Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs. Optim Lett 18:1217\u20131235","journal-title":"Optim Lett"},{"key":"1397_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","volume":"57","author":"S Gawiejnowicz","year":"1996","unstructured":"Gawiejnowicz S (1996) A note on scheduling on a single processor with speed dependent on a number of executed jobs. Inf Process Lett 57:297\u2013300","journal-title":"Inf Process Lett"},{"issue":"1","key":"1397_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK et al (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(1):287\u2013326","journal-title":"Ann Discrete Math"},{"key":"1397_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-4976-8","volume-title":"Group technology: application to production management[M]","author":"I Ham","year":"1985","unstructured":"Ham I, Hitomi K, Yoshida T (1985) Group technology: application to production management[M]. Kluwer Nijhoff, Boston"},{"key":"1397_CR8","volume-title":"Inequalities","author":"GH Hardy","year":"1967","unstructured":"Hardy GH, Littlewood JE, Polya G (1967) Inequalities. Cambridge University Press"},{"issue":"8","key":"1397_CR9","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1016\/j.cor.2004.11.024","volume":"33","author":"WH Kuo","year":"2006","unstructured":"Kuo WH, Yang DL (2006) Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research 33(8):2099\u20132112","journal-title":"Computers & Operations Research"},{"key":"1397_CR10","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.ijpe.2015.10.002","volume":"170","author":"CD Liou","year":"2015","unstructured":"Liou CD, Hsieh YC (2015) A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. Int J Prod Econ 170:258\u2013267","journal-title":"Int J Prod Econ"},{"key":"1397_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.12.006","volume":"70","author":"J Neufeld","year":"2016","unstructured":"Neufeld J, Gupta JN, Buscher U (2016) A comprehensive review of flowshop group scheduling literature. Computers & Operations Research 70:56\u201374","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1397_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"S Panwalkar","year":"1982","unstructured":"Panwalkar S, Smith M, Seidmann A (1982) Common due date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30(2):391\u2013399","journal-title":"Oper Res"},{"key":"1397_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109750","volume":"186","author":"J Qian","year":"2023","unstructured":"Qian J (2023) Note on single machine common flow allowance group scheduling with learning effect and resource allocation. Computers & Industrial Engineering 186:109750","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"1397_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1080\/00207548108956667","volume":"19","author":"A Seidmann","year":"1981","unstructured":"Seidmann A, Panwalkar SS, Smith M (1981) Optimal assignment of due-dates for a single processor scheduling problem. Int J Prod Res 19(4):393\u2013399","journal-title":"Int J Prod Res"},{"key":"1397_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120878","volume":"233","author":"DN Sekkal","year":"2023","unstructured":"Sekkal DN, Belkaid F (2023) A multi-objective optimization algorithm for flow shop group scheduling problem with sequence dependent setup time and worker learning. Expert Syst Appl 233:120878","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1397_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ejor.2015.12.043","volume":"252","author":"D Shabtay","year":"2016","unstructured":"Shabtay D (2016) Optimal restricted due date assignment in scheduling. Eur J Oper Res 252(1):79\u201389","journal-title":"Eur J Oper Res"},{"key":"1397_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106126","volume":"139","author":"L Sun","year":"2020","unstructured":"Sun L, Yu AJ, Wu B (2020) Single machine common flow allowance group scheduling with learning effect and resource allocation. Computers & Industrial Engineering 139:106126","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"1397_CR18","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1080\/01605682.2020.1806746","volume":"72","author":"X Sun","year":"2020","unstructured":"Sun X, Geng XN, Liu F (2020) Flow shop scheduling with general position weighted learning effects to minimise total weighted completion time. Journal of the Operational Research Society 72(12):2674\u20132689","journal-title":"Journal of the Operational Research Society"},{"key":"1397_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ijpe.2015.06.018","volume":"168","author":"D Wang","year":"2015","unstructured":"Wang D, Yin Y, Xu J et al (2015) Some due date determination scheduling problems with two agents on a single machine. Int J Prod Econ 168:81\u201390","journal-title":"Int J Prod Econ"},{"issue":"10","key":"1397_CR20","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1057\/palgrave.jors.2602276","volume":"58","author":"DL Yang","year":"2007","unstructured":"Yang DL, Kuo WH (2007) Single-machine scheduling with an actual time-dependent learning effect. Journal of the Operational Research Society 58(10):1348\u20131353","journal-title":"Journal of the Operational Research Society"},{"key":"1397_CR21","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.apm.2019.01.036","volume":"71","author":"L Yang","year":"2019","unstructured":"Yang L, Zhao Y, Ma X (2019) Group maintenance scheduling for two-component systems with failure interaction. Appl Math Model 71:118\u2013137","journal-title":"Appl Math Model"},{"issue":"3","key":"1397_CR22","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1504\/EJIE.2013.054135","volume":"7","author":"Y Yin","year":"2013","unstructured":"Yin Y, Wu CC, Wu WH et al (2013) Single-machine group scheduling with a general learning effect. European Journal of Industrial Engineering 7(3):350\u2013369","journal-title":"European Journal of Industrial Engineering"},{"key":"1397_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113360","volume":"152","author":"S Yuan","year":"2020","unstructured":"Yuan S, Li T, Wang B (2020) A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert Syst Appl 152:113360","journal-title":"Expert Syst Appl"},{"key":"1397_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2018.01.002","volume":"117","author":"X Zhang","year":"2018","unstructured":"Zhang X, Liao L, Zhang W et al (2018) Single-machine group scheduling with new models of position-dependent processing times. Computers & Industrial Engineering 117:1\u20135","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01397-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01397-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01397-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:59:46Z","timestamp":1774724386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01397-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1397"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01397-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"28"}}