{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:17:52Z","timestamp":1783149472843,"version":"3.54.6"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFA1013901"],"award-info":[{"award-number":["2024YFA1013901"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571343"],"award-info":[{"award-number":["12571343"]}],"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":["12471289"],"award-info":[{"award-number":["12471289"]}],"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"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107462","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:46:59Z","timestamp":1777528019000},"page":"107462","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A note on multi-agent scheduling to minimize the total weighted number of tardy jobs"],"prefix":"10.1016","volume":"67","author":[{"given":"Rubing","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiulan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107462_bib0001","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/opre.1030.0092","article-title":"Scheduling problems with two competing agents","volume":"52","author":"Agnetis","year":"2004","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0002","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1022231419049","article-title":"A multiple-criterion model for machine scheduling","volume":"6","author":"Baker","year":"2003","journal-title":"J. Sched."},{"key":"10.1016\/j.orl.2026.107462_bib0003","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.ejor.2021.10.064","article-title":"Pareto-scheduling of two competing agents with their own equal processing times","volume":"301","author":"Chen","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0004","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s10951-018-0598-5","article-title":"The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs","volume":"22","author":"Chen","year":"2019","journal-title":"J. Sched."},{"key":"10.1016\/j.orl.2026.107462_bib0005","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","article-title":"Competitive two agents scheduling and its applications","volume":"58","author":"Leung","year":"2010","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0006","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2024.10.023","article-title":"Analyzing the price of fairness in scheduling problems with two agents","volume":"321","author":"Yu","year":"2025","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0007","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.orl.2026.107462_bib0008","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: motivation, examples, and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.orl.2026.107462_bib0009","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2006.07.011","article-title":"Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs","volume":"362","author":"Cheng","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.orl.2026.107462_bib0010","series-title":"Multiagent Scheduling: Models and Algorithms","author":"Agnetis","year":"2014"},{"key":"10.1016\/j.orl.2026.107462_bib0011","doi-asserted-by":"crossref","DOI":"10.1007\/s40305-025-00598-9","article-title":"Multi-agent scheduling to minimize total completion times","author":"Chen","year":"2025","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.orl.2026.107462_bib0012","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.disopt.2017.01.001","article-title":"Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs","volume":"23","author":"Sadi","year":"2017","journal-title":"Discrete Optim."},{"key":"10.1016\/j.orl.2026.107462_bib0013","unstructured":"R.B. Chen, S.S. Li, J.J. Yuan, Q.L. Zhao, Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines, Eur. J. Oper. Res.submitted."},{"key":"10.1016\/j.orl.2026.107462_bib0014","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.ejor.2007.04.040","article-title":"Multi-agent scheduling on a single machine with max-form criteria","volume":"188","author":"Cheng","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0015","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-020-00646-7","article-title":"Single-machine scheduling with multi-agents to minimize total weighted late work","volume":"23","author":"Li","year":"2020","journal-title":"J. Sched."},{"key":"10.1016\/j.orl.2026.107462_bib0016","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-006-0164-y","article-title":"Multi-agent single machine scheduling","volume":"150","author":"Agnetis","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0017","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1080\/00207543.2023.2188646","article-title":"Scheduling a multi-agent flow shop with two scenarios and release dates","volume":"62","author":"Wang","year":"2024","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0018","doi-asserted-by":"crossref","first-page":"3633","DOI":"10.1080\/00207543.2020.1748908","article-title":"Multi-agent scheduling problems under multitasking","volume":"59","author":"Wang","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0019","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s40305-016-0124-4","article-title":"Complexities of some problems on multi-agent scheduling on a single machine","volume":"4","author":"Yuan","year":"2016","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.orl.2026.107462_bib0020","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.ejor.2019.07.072","article-title":"Scheduling with release dates and preemption to minimize multiple max-form objective functions","volume":"280","author":"Yuan","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2026.107462_bib0021","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1002\/nav.21961","article-title":"Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work","volume":"68","author":"Zhang","year":"2021","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.orl.2026.107462_bib0022","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000593?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000593?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:45:00Z","timestamp":1783147500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":22,"alternative-id":["S0167637726000593"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107462","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A note on multi-agent scheduling to minimize the total weighted number of tardy jobs","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107462","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107462"}}