{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:15:34Z","timestamp":1767190534022,"version":"3.48.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:00:00Z","timestamp":1758844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M743210"],"award-info":[{"award-number":["2023M743210"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271491"],"award-info":[{"award-number":["12271491"]}],"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":["12371318"],"award-info":[{"award-number":["12371318"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004609","name":"Foundation of Henan Educational Committee","doi-asserted-by":"publisher","award":["25A110014"],"award-info":[{"award-number":["25A110014"]}],"id":[{"id":"10.13039\/501100004609","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":[[2025,10]]},"DOI":"10.1007\/s10878-025-01353-9","type":"journal-article","created":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T19:19:51Z","timestamp":1758914391000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs"],"prefix":"10.1007","volume":"50","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rubing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"key":"1353_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.3934\/jimo.2014.10.219","volume":"10","author":"MO Adamu","year":"2014","unstructured":"Adamu MO, Adewumi AO (2014) A survey of single machine scheduling to minimize weighted number of tardy jobs. J Ind Manage Optim 10:219\u2013241","journal-title":"J Ind Manage Optim"},{"key":"1353_CR2","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.3934\/jimo.2016.12.1465","volume":"12","author":"MO Adamu","year":"2016","unstructured":"Adamu MO, Adewumi AO (2016) Minimizing the weighted number of tardy jobs on multiple machines: a review. J Ind Manage Optim 12:1465\u20131493","journal-title":"J Ind Manage Optim"},{"key":"1353_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ejor.2021.10.064","volume":"301","author":"RB Chen","year":"2022","unstructured":"Chen RB, Geng ZC, Lu LF, Yuan JJ, Zhang Y (2022) Pareto-scheduling of two competing agents with their own equal processing times. Eur J Oper Res 301:414\u2013431","journal-title":"Eur J Oper Res"},{"key":"1353_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.107969","volume":"167","author":"RB Chen","year":"2022","unstructured":"Chen RB, He RY, Yuan JJ (2022) Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs. Comput Ind Eng 167:107969","journal-title":"Comput Ind Eng"},{"key":"1353_CR5","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1002\/nav.22103","volume":"70","author":"RB Chen","year":"2023","unstructured":"Chen RB, Yuan JJ, Zhao QL, Ng CT, Cheng TCE (2023) Bicriterion pareto-scheduling of equal-length jobs on a single machine related to the total weighted late work. Nav Res Logist 70:537\u2013557","journal-title":"Nav Res Logist"},{"key":"1353_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","volume":"44","author":"MI Dessouky","year":"1990","unstructured":"Dessouky MI, Lageweg BJ, Lenstra JK, van de Velde SL (1990) Scheduling identical jobs on uniform parallel machines. Stat Neerl 44:115\u2013123","journal-title":"Stat Neerl"},{"key":"1353_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11590-020-01576-1","volume":"15","author":"Y Gao","year":"2020","unstructured":"Gao Y, Yuan JJ, Ng CT, Cheng TCE (2020) A note on competing-agent pareto-scheduling. Optim Lett 15:249\u2013262","journal-title":"Optim Lett"},{"key":"1353_CR8","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.3390\/math11041013","volume":"11","author":"SE Guo","year":"2023","unstructured":"Guo SE, Lang H, Zhang HX (2023) Scheduling of jobs with multiple weights on a single machine for minimizing the total weighted number of tardy jobs. Mathematics 11:1013","journal-title":"Mathematics"},{"key":"1353_CR9","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1002\/nav.22050","volume":"69","author":"SE Guo","year":"2022","unstructured":"Guo SE, Lu LF, Yuan JJ, Ng CT, Cheng TCE (2022) Pareto-scheduling with double-weighted jobs to minimize the weighted number of tardy jobs and total weighted late work. Nav Res Logist 69:816\u2013837","journal-title":"Nav Res Logist"},{"key":"1353_CR10","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-021-00697-2","volume":"41","author":"RY He","year":"2021","unstructured":"He RY, Yuan JJ, Ng CT, Cheng TCE (2021) Two-agent preemptive pareto-scheduling to minimize the number of tardy jobs and total late work. J Comb Optim 41:504\u2013525","journal-title":"J Comb Optim"},{"key":"1353_CR11","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167:592\u2013623","journal-title":"Eur J Oper Res"},{"key":"1353_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2005.06.067","volume":"177","author":"YM Huo","year":"2007","unstructured":"Huo YM, Leung JYT, Zhao HR (2007) Bi-criteria scheduling problems: number of tardy jobs and maximum weighted tardiness. Eur J Oper Res 177:116\u2013134","journal-title":"Eur J Oper Res"},{"key":"1353_CR13","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10951-011-0231-3","volume":"14","author":"SA Kravchenko","year":"2011","unstructured":"Kravchenko SA, Werner F (2011) Parallel machine problems with equal processing times: a survey. J Sched 14:435\u2013444","journal-title":"J Sched"},{"key":"1353_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","volume":"244","author":"D Oron","year":"2015","unstructured":"Oron D, Shabtay D, Steiner G (2015) Single machine scheduling with two competing agents and equal job processing times. Eur J Oper Res 244:86\u201399","journal-title":"Eur J Oper Res"},{"key":"1353_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-05921-6","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2022","unstructured":"Pinedo ML (2022) Scheduling: theory, algorithms, and systems, 6th edn. Springer, Berlin","edition":"6"},{"key":"1353_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:JOCO.0000038909.06086.ed","volume":"8","author":"SC Sarin","year":"2004","unstructured":"Sarin SC, Prakash D (2004) Equal processing time bicriteria scheduling on parallel machines. J Comb Optim 8:227\u2013240","journal-title":"J Comb Optim"},{"key":"1353_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/j.ejor.2004.04.009","volume":"165","author":"SV Sevastianov","year":"2005","unstructured":"Sevastianov SV (2005) An introduction to multi-parameter complexity analysis of discrete problems. Eur J Oper Res 165:387\u2013397","journal-title":"Eur J Oper Res"},{"key":"1353_CR18","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V Tkindt","year":"2006","unstructured":"Tkindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin","edition":"2nd"},{"key":"1353_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0305-0548(98)80005-1","volume":"25","author":"A Tuzikov","year":"1998","unstructured":"Tuzikov A, Makhaniok M, Manner R (1998) Bicriterion scheduling of identical processing time jobs by uniform processors. Comput Oper Res 25:31\u201335","journal-title":"Comput Oper Res"},{"key":"1353_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2020.07.064","volume":"290","author":"L Wan","year":"2021","unstructured":"Wan L, Mei JJ, Du JZ (2021) Two-agent scheduling of unit processing time to minimize total weighted completion time and total weighted number of tardy jobs. Eur J Oper Res 290:26\u201335","journal-title":"Eur J Oper Res"},{"key":"1353_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s11590-017-1141-x","volume":"12","author":"JJ Yuan","year":"2018","unstructured":"Yuan JJ (2018) Complexities of four problems on two-agent scheduling. Optim Lett 12:763\u2013780","journal-title":"Optim Lett"},{"key":"1353_CR22","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/nav.21961","volume":"68","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Yuan JJ, Ng CT, Cheng TCE (2020) Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work. Nav Res Logist 68:378\u2013393","journal-title":"Nav Res Logist"},{"key":"1353_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","volume":"39","author":"QL Zhao","year":"2020","unstructured":"Zhao QL, Yuan JJ (2020) Bicriteria scheduling of equal length jobs on uniform parallel machines. J Comb Optim 39:637\u2013661","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-025-01353-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01353-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01353-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T14:10:58Z","timestamp":1767190258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01353-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,26]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01353-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,9,26]]},"assertion":[{"value":"16 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2025","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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"24"}}