{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:21:59Z","timestamp":1780626119316,"version":"3.54.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2026.02.029","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T23:35:44Z","timestamp":1771716944000},"page":"701-712","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1590-2998","authenticated-orcid":false,"given":"Rubing","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3197-1558","authenticated-orcid":false,"given":"Shi-Sheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9814-615X","authenticated-orcid":false,"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7931-6176","authenticated-orcid":false,"given":"Qiulan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.02.029_bib0001","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41880-8","article-title":"Multiagent Scheduling: Models and Algorithms","author":"Agnetis","year":"2014"},{"key":"10.1016\/j.ejor.2026.02.029_bib0002","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ejor.2018.12.048","article-title":"Price of fairness in two-agent single-machine scheduling problems","volume":"276","author":"Agnetis","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0003","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":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0004","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":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0005","doi-asserted-by":"crossref","first-page":"289","DOI":"10.5267\/j.ijiec.2017.8.005","article-title":"A two-agent scheduling problem in a two-machine flowshop","volume":"9","author":"Ahmadi-Darani","year":"2018","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"10.1016\/j.ejor.2026.02.029_bib0006","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1002\/net.20023","article-title":"A competitive scheduling problem and its relevance to umts channel assignment","volume":"44","author":"Arbib","year":"2004","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2026.02.029_bib0007","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":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.029_bib0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(03)00339-1","article-title":"Open shop scheduling problems with late work criteria","volume":"134","author":"Blazewicz","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2026.02.029_bib0009","series-title":"Parallel-machine scheduling with machine unavailability to maximize total early work","first-page":"1","author":"Chen","year":"2025"},{"key":"10.1016\/j.ejor.2026.02.029_bib0010","series-title":"Multi-agent scheduling to minimize total completion times","author":"Chen","year":"2025"},{"key":"10.1016\/j.ejor.2026.02.029_bib0011","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0012","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/nav.22103","article-title":"Bicriterion pareto-scheduling of equal-length jobs on a single machine related to the total weighted late work","volume":"70","author":"Chen","year":"2023","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.ejor.2026.02.029_bib0013","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/0305215X.2018.1458844","article-title":"Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs","volume":"51","author":"Chen","year":"2019","journal-title":"Engineering Optimization"},{"key":"10.1016\/j.ejor.2026.02.029_bib0014","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":"Theoretical Computer Science"},{"key":"10.1016\/j.ejor.2026.02.029_bib0015","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":"European journal of operational research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0016","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-012-1099-0","article-title":"Two-agent scheduling on uniform parallel machines with min-max criteria","volume":"213","author":"Elvikis","year":"2014","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0017","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.ejor.2016.01.009","article-title":"Two-agent scheduling in a flowshop","volume":"252","author":"Fan","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0018","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2018.07.040","article-title":"A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan","volume":"273","author":"Gao","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0019","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.ejor.2026.02.029_bib0020","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-024-01205-y","article-title":"Minimizing the maximum lateness for scheduling with release times and job rejection","volume":"48","author":"Kacem","year":"2024","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2026.02.029_bib0021","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10951-011-0231-3","article-title":"Parallel machine problems with equal processing times: A survey","volume":"14","author":"Kravchenko","year":"2011","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.029_bib0022","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10951-010-0190-0","article-title":"Scheduling jobs with equal processing times subject to machine eligibility constraints","volume":"14","author":"Lee","year":"2011","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.029_bib0023","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.cie.2017.02.001","article-title":"A three-agent scheduling problem for minimizing the makespan on a single machine","volume":"106","author":"Lee","year":"2017","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.02.029_bib0024","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1287\/opre.1090.0744","article-title":"Competitive two-agent scheduling and its applications","volume":"58","author":"Leung","year":"2010","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0025","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10951-023-00779-5","article-title":"Competitive two-agent scheduling with release dates and preemption on a single machine","volume":"26","author":"Li","year":"2023","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.029_bib0026","doi-asserted-by":"crossref","first-page":"9799","DOI":"10.1080\/00207543.2025.2525534","article-title":"Parallel-batching scheduling with two agents, release dates and equal processing times","volume":"63","author":"Li","year":"2025","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0027","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":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2026.02.029_bib0028","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2015.01.003","article-title":"Single machine scheduling with two competing agents and equal job processing times","volume":"244","author":"Oron","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0029","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ejor.2025.07.012","article-title":"Scheduling mixed batch machines with inclusive processing set restrictions and non-identical capacities","volume":"328","author":"Ou","year":"2026","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0030","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ajsl.2018.12.008","article-title":"Two-agent scheduling with generalized due dates","volume":"34","author":"Park","year":"2018","journal-title":"Asian Journal of Shipping and Logistics"},{"key":"10.1016\/j.ejor.2026.02.029_bib0031","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2013.09.017","article-title":"A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems","volume":"235","author":"Perez-Gonzalez","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0032","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 Optimization"},{"key":"10.1016\/j.ejor.2026.02.029_bib0033","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:JOCO.0000038909.06086.ed","article-title":"Equal processing time bicriteria scheduling on parallel machines","volume":"8","author":"Sarin","year":"2004","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.ejor.2026.02.029_bib0034","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2017.05.019","article-title":"Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine","volume":"263","author":"Tang","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0035","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ejor.2016.10.024","article-title":"Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes","volume":"258","author":"Wang","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0036","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":"International Journal of Production Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0037","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":"Journal of the Operations Research Society of China"},{"key":"10.1016\/j.ejor.2026.02.029_bib0038","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":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.029_bib0039","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.dam.2016.05.014","article-title":"Scheduling jobs with equal processing times and a single server on parallel identical machines","volume":"213","author":"Zhang","year":"2016","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2026.02.029_bib0040","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 Research Logistics"},{"key":"10.1016\/j.ejor.2026.02.029_bib0041","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","article-title":"Bicriteria scheduling of equal length jobs on uniform parallel machines","volume":"39","author":"Zhao","year":"2020","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T18:30:41Z","timestamp":1777660241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726001785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221726001785"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.029","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.029","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"}]}}